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

enter image description here

enter image description here

enter image description here

enter image description here
ADD COMMENT EDIT
Please log in to add an answer.