Register

PDA Doubt

• edited by
1,527 views
0 0 votes
Please can anyone explain the PDA for reverse of a string via a transition graph

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Dynamic programmingNext → · GATE CSE
← Previous in category · Theory of computatio...Next in category → · GATE CSE
Position:
Show:

Related questions

0 0 votes
0 0 answers
782
782 views
Satbir asked Dec 10, 2018
782 views
pda doubt
Consider the following PDA:The language accepted by the given PDA is: L = {(b^n a b^n a )^m | m, n >= 0} L = {b^n a b^n a | n >= 0} {bn | n >= 0} L = {b^n a b^n a | n >= ...
0 0 votes
0 0 answers
2.6k
2.6k views
aditi19 asked Sep 2, 2018
2,563 views
Doubt-PDA
what is the PDA for {L=$a^mb^n$ |m>n}
1 1 vote
1 1 answer
788
788 views
dragonball asked Oct 29, 2017
788 views
PDA Doubt
In the below diagram which solution is correct and why ?
1 1 vote
1 1 answer
87
87 views
GO Classes asked Sep 14
87 views
GO Classes DPP | GATE CS | Theory of Computation | PDA Trace
A PDA accepts $L=\{0^{2n}1^n\mid n>0\}$. Which strings are accepted?$001$ $000011$ $0001$ $000000111$ $\epsilon$