4 votes 4 votes Construct npda for the following languages on $∑ =$ {$a,b,c$} $L =$ { $w : n_a(w) = 2*n_b(w)$ } Theory of Computation peter-linz peter-linz-edition4 theory-of-computation pushdown-automata npda + – Vishal Goel asked Apr 30, 2017 edited Apr 20, 2019 by Naveen Kumar 3 Vishal Goel 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 1) L={a^2n b^n } Ram Swaroop answered Dec 19, 2018 edited Dec 19, 2018 by Ram Swaroop Ram Swaroop comment Share Follow See all 2 Comments See all 2 2 Comments reply Veenit commented Nov 13, 2019 reply Follow Share This would not work as the examples taken assume that 'b's occur after 'a's. 1 votes 1 votes JAINchiNMay commented Jan 21, 2021 reply Follow Share why you have considered a^2nb^n? 0 votes 0 votes Please log in or register to add a comment.