346 views

1 Answer

0 votes
0 votes

first solution is correct for the given language.

In second solution, after getting equal no. of a's and b's, you can able to put only one 'c' .

In general second solution is accepting = {a^n b^n c d | n>0}

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
943 views
what is the PDA for {L=$a^mb^n$ |m>n}
0 votes
0 votes
0 answers
3
Devshree Dubey asked Jun 28, 2018
691 views
Please can anyone explain the PDA for reverse of a string via a transition graph
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.