Professional Documents
Culture Documents
Push Down Automata
Push Down Automata
Push Down Automata
Swarnalatha Prathipati
Assistant Professor
Department of CSE
GITAM Institute of Technology (GIT)
Visakhapatnam – 530045
Email: sprathip2@gitam.edu
Ph no:7893210891
Tuesday, January 05, 2021 Department of CSE, GIT ECS301_FLAT UNIT-4 1
Course objectives
Pushdown automaton(PDA)
Equivalence between acceptance by empty store and acceptance by
final state
Equivalence of CFG and PDA.
• FSM has a very limited memory but PDA has more memory.
1. An Input tape
2. Finite control unit
3. Stack structure with infinite size.
•We can construct a PDA from given CFG similarly we can obtain a CFG
from given PDA.
•The algorithm for this is given with the help of following theorem.
If A=(Q, ∑, Γ, q0, Z0, F, δ) is a PDA then there exists CFG G which is accepted
by PDA A.
And for getting the production rules P we will apply the following algorithm