0 votes 0 votes Prove that an npda for accepting the language $L =$ { $ww^R : w ∈$ {$a, b$}$^+$ } does not accept any string not in {$ww^R$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation pushdown-automata npda + – Naveen Kumar 3 asked Apr 20, 2019 Naveen Kumar 3 173 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.