1,706 views

1 Answer

Best answer
0 votes
0 votes
No! Considering W ∈ {a,b}*, we can't draw a PDA for the language.
Initially we push input alphabets (W) to stack and once we encounter c, we can't check if W = W.
selected by

Related questions

1 votes
1 votes
0 answers
1
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.
1 votes
1 votes
1 answer
4
manisha11 asked May 13, 2019
593 views
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack.DPDA with empty stack accepts LR(0) grammar.Can someone explain in depth/...