Theory of Computation20785 marksConstruction of PDA by Final State
Define a Push Down Automata. Construct a PDA that accepts L = an bn mid n > 0.
Define a Push Down Automata. Construct a PDA that accepts $L = {a^n b^n \mid n > 0}$. [5]
A Push Down Automata (PDA) is a finite automaton equipped with an additional stack memory. It is a 7-tuple defined as: $$M = (Q, \Sigma, \Gamma, \delta, q0, Z0, F)$$ Where: Component Description ------------------------ $Q$ Finite set of states $\Sigma$ Finite set of input symbols (input alphabet...