368 views

1 Answer

1 votes
1 votes

Solving using counter examples:

  1. example w= aba, Is not accepted by PDA. hence incorrect.
  2. example w= ab, Is not accepted by PDA. hence incorrect.
  3. example w= abba, Is not accepted by PDA. hence incorrect.
  4. Hence None of the above i.e. option d is correct.

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/...