1,616 views
1 votes
1 votes

Consider the following PDA:

Which of the following language accepted by above PDA?

  • All string that start and end with same symbol.
  • All string that contain same number of ‘a’ and ‘b’.
  • Contain same numbers of ‘a’ and ‘b’ and start and end with same symbol.
  • None of the above

3 Answers

0 votes
0 votes
The PDA accepts the language with same number of a's and b's, starting and ending with different symbols.

ex: abab , abaabb are the strings thar are accepted by PDA.

So ans is D, None of the above

Related questions

0 votes
0 votes
2 answers
2
Alakhator asked Nov 11, 2018
870 views
Construct a PDA for set of strings over {a,b,c,d} such thatL={ a^i b^j c^k d^l / i=k or j=l , i,j,k,l >=1}
0 votes
0 votes
1 answer
3
Abhisek Tiwari 4 asked Nov 6, 2018
703 views
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack ThenA)Ldf proper subset of Lef.B)Ldf = Lef.C)Lef ...