closed by
444 views
0 votes
0 votes

Consider the following PDA:

The language accepted by the given PDA is:

 

  1. L = {(b^n a b^n a )^m | m, n >= 0}

 

  1. L = {b^n a b^n a | n >= 0} {bn | n >= 0}

 

  1. L = {b^n a b^n a | n >= 0}

 

  1. L = {(b^n a b^n a )^m | m, n >= 0} {bn | n >= 0}
closed by

Related questions

0 votes
0 votes
0 answers
1
aditi19 asked Sep 2, 2018
994 views
what is the PDA for {L=$a^mb^n$ |m>n}
0 votes
0 votes
0 answers
2
Devshree Dubey asked Jun 28, 2018
722 views
Please can anyone explain the PDA for reverse of a string via a transition graph
1 votes
1 votes
1 answer
3
dragonball asked Oct 29, 2017
356 views
In the below diagram which solution is correct and why ?
1 votes
1 votes
0 answers
4
alexmurugan asked Nov 3, 2023
361 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.