The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
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}

asked ago in Theory of Computation by (23 points) | 15 views
your PDA not visible.:(

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

36,995 questions
44,571 answers
43,637 users