Awesome q2a theme
0 votes
14 views

Option a. language also generates aa when m=1 and n=0 but in the given transitions there is no transition for (q0,a)   when it is first read when stack contains z0 as stack symbol then how it can accept all  strings generated by language . Can anyone please explain the solution

 

in Theory of Computation by (119 points) | 14 views
0
yes, you are correct ! it should have n > 0

Please log in or register to answer this question.

Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
932 questions
596 answers
1,885 comments
81,474 users