Ask
Login
0
9.4kviews
Design a Turing Machine to recognize the Language $ L={a^n b^n a^n |n>=1}$
written 7.9 years ago by gravatar for pratikj2208 pratikj2208 • 150 modified 5.7 years ago by gravatar for prashantsaini prashantsaini • 0
automata theory
ADD COMMENT EDIT
1 Answer
1
467views
written 7.9 years ago by gravatar for pratikj2208 pratikj2208 • 150

enter image description here

enter image description here

enter image description here

enter image description here

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.