0 votes 0 votes Let $E=\{a^{i}b^{j}\mid i\neq j$ $\text{and}$ $2i\neq j\}.$ Show that $E$ is a context-free language$.$ Theory of Computation michael-sipser theory-of-computation context-free-language proof + – admin asked May 4, 2019 • edited May 4, 2019 by Lakshman Bhaiya admin 231 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S->aaAb | aBbbb | C | D A->aAb | aA | a B->aBb | a C->aA | a D->bB | b aditi19 answered Aug 18, 2019 aditi19 comment Share Follow See all 0 reply Please log in or register to add a comment.