pushdown automata (pda)
pushdown automata (pda)
pushdown automata (pda)
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Deterministic CaseA deterministic <strong>pushdown</strong> acceptor (d<strong>pda</strong>) never has achoice for its move. We require for d<strong>pda</strong> thatδ(q,a,b) contains at most one element.If δ(q,λ,b) is non-empty, then δ(q,c,b) is empty forall c ∈ Σ,Note that for d<strong>pda</strong> we allow λ-transition or no move,unlike the case of dfa.d<strong>pda</strong> and n<strong>pda</strong> are not equal in their descriptivepowers. There are languages that can be accepted byn<strong>pda</strong> but not by any d<strong>pda</strong>. This is also different fromthe case of dfa and nfa.Pushdown Automata – p. 18
Change language