0 votes 0 votes Find an npda on $Σ =$ {$a, b, c$} that accepts the language $L=${$w_1cw_2:w_1,w_2∈$ {$a,b$}$^*,w_1\neq w_2^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 411 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.