0 0 votes $L=\{a^nb^n\mid n≥0\}$ Kindly draw a PDA for this, I'm confused, how to deal with epsilon string? Theory of Computation theory-of-computation pushdown-automata + – iarnav 1.4k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 1 1 vote to accept null ,,,make 1st state(q0) as final state when you get number's of a = number's of b then moved to final state(q0) pawan kumarln answered Sep 15, 2017 • selected Sep 15, 2017 by srestha pawan kumarln comment Share Follow See all 2 Comments 2 2 Comments reply iarnav commented Sep 15, 2017 reply Follow flag @pawan kumarln Thanks a lot. 0 0 replyShare aaaakash001 commented Oct 6, 2022 reply Follow flag PDA is wrong, every move is correct but one. null move from q2 to q0 will make PDA accept languages like aba, aabbaaa, instead null move back to q0 we can make new state q3. 0 0 replyShare Please log in or register to add a comment.
0 0 votes . aaaakash001 answered Oct 6, 2022 aaaakash001 comment Share Follow 0 reply Please log in or register to add a comment.
