Theory of Computation20795 marksRepresentation of PDA
Give the formal definition of Push Down Automata. How CFG can be converted into equivalent PDA. Explain with an example.
Give the formal definition of Push Down Automata. How CFG can be converted into equivalent PDA. Explain with an example. [5]
--- A Pushdown Automaton (PDA) is a 7-tuple: $$M = (Q, \Sigma, \Gamma, \delta, q0, Z0, F)$$ Where: Component Description ------------------------ $Q$ Finite set of states $\Sigma$ Finite set of input symbols (input alphabet) $\Gamma$ Finite set of stack symbols (stack alphabet) $\delta$ Transitio...