0 votes 0 votes Prove that the pda in Example 7.6 accepts the language $L =$ {$a^{n+1}b^{2n} : n ≥ 0$ }. Theory of Computation theory-of-computation peter-linz peter-linz-edition4 pushdown-automata + – Naveen Kumar 3 asked Jun 22, 2019 Naveen Kumar 3 186 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.