in Theory of Computation edited by
745 views
0 votes
0 votes
Please can anyone explain the PDA for reverse of a string via a transition graph
in Theory of Computation edited by
745 views

4 Comments

@Shaik Masthan,A big Thanks to you brother for clearing my doubt. I've now understood what you want to convey. My doubt is now solved. Thank you for sparing your time brother.:)
1
1

@Shaik Masthan if x here belongs to (a+b)* then how can I draw pda for it ,can you give some idea?

0
0
edited by

If x is belongs to (0+1)*, then it's npda.. DFA

By keeping w = epsilon, x generate universal language.

0
0

Please log in or register to answer this question.