0 votes 0 votes Use Ogden's lemma $($Question $3)$ to show that the following languages are not $CFL's:$ $\{0^{i}1^{j}0^{k}|k=max(i,k)\}.$ $\{a^{n}b^{n}c^{i}|i\neq n\}.$ Hint$:$ If $n$ is the constant for Ogden's lemma,consider the stirng $z=a^{n}b^{n}c^{n+n!}.$ Theory of Computation ullman theory-of-computation context-free-language + – admin asked Apr 11, 2019 admin 109 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.