475 views
0 votes
0 votes

Consider a push down automata (PDA) below which runs over the input alphabet (a, b). It has the stack alphabet {z0, X} where z0 is the bottom of stack marker. The set of states of PDA is {q0, q1} where q0 is the start state.

The language accepted by PDA is

and in answer 

 and in answer given that a term and union with that i can not understanding how it can accept it{bn |n>=0}

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
prasoon054 asked Dec 7, 2023
165 views
Is countable sets part of GATE CS 2024 syllabus?
3 votes
3 votes
2 answers
2
1 votes
1 votes
1 answer
3