edited by
691 views
0 votes
0 votes
Please can anyone explain the PDA for reverse of a string via a transition graph
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Satbir asked Dec 10, 2018
429 views
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 votes
0 votes
0 answers
2
aditi19 asked Sep 2, 2018
944 views
what is the PDA for {L=$a^mb^n$ |m>n}
1 votes
1 votes
1 answer
3
dragonball asked Oct 29, 2017
346 views
In the below diagram which solution is correct and why ?
1 votes
1 votes
0 answers
4
alexmurugan asked Nov 3, 2023
334 views
Design the Push down Automata for the language L={anbmc2nd3m,n,m>=1}.Check the acceptance string by both the empty stack and final state method.