Non-deterministic pushdown automaton that accepts the language generated by the grammar: $S \rightarrow aSS \mid ab$ is
- $\delta (q_0, \lambda , z)= \{ (q_1, z) \}; \delta(q_0, a, S) = \{ (q_1, SS) \}, (q_1, B) \} \delta (q_0, b, B) = \{ (q_1, \lambda) \}, \delta (q_1, \lambda , z) = \{ (q_f, \lambda ) \} $
- $\delta (q_0, \lambda , z)= \{ (q_1, Sz) \}; \delta(q_0, a, S) = \{ (q_1, SS) \}, (q_1, B) \} \delta (q_0, b, B) = \{ (q_1, \lambda) \}, \delta (q_1, \lambda , z) = \{ (q_f, \lambda ) \}$
- $\delta (q_0, \lambda , z)= \{ (q_1, Sz) \}; \delta(q_0, a, S) = \{ (q_1, S) \}, (q_1, B) \} \delta (q_0, b, \lambda) = \{ (q_1, B) \}, \delta (q_1, \lambda , z) = \{( q_f, \lambda ) \}$
- $\delta (q_0, \lambda , z)= \{ (q_1, z) \}; \delta(q_0, a, S) = \{ (q_1, SS) \}, (q_1, B) \} \delta (q_0, b, \lambda) = \{ (q_1,B) \}, \delta (q_1, \lambda , z) = \{ (q_f, \lambda ) \}$