0 votes 0 votes Is the language $L = \{a^nb^m:n=2^m\}$ context free$?$ Theory of Computation peter-linz peter-linz-edition5 theory-of-computation pumping-lemma context-free-language + – Rishi yadav asked Apr 15, 2019 Rishi yadav 239 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.