2 votes 2 votes How below language is context free? I am not able to imagine what could be the behaviour of the PDA accepting this language. Can anyone give a hint? $L=\{\omega:2n_a(\omega)\leq n_b(\omega)\leq 3n_a(\omega)\}$ Theory of Computation theory-of-computation context-free-language + – Mahesha999 asked Dec 24, 2016 retagged Jul 4, 2017 by Arjun Mahesha999 285 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes This can be a NPDA with every a push 2 X's or 3X's and for every b pop 2 X's this question is similar to https://gateoverflow.in/97039/context-free-language Pankaj Joshi answered Dec 28, 2016 Pankaj Joshi comment Share Follow See all 0 reply Please log in or register to add a comment.