0 votes 0 votes Consider the following languages$:$ $L_{1}=\{a^{n}b^{2n}c^{m}|n,m\geq 0\}$ $L_{2}=\{a^{n}b^{m}c^{2m}|n,m\geq 0\}$ Show that each of these languages is context-free by giving grammars for each. Is $L_{1}\cap L_{2}$ a $CFL?$ Justify your answer. Theory of Computation ullman theory-of-computation context-free-language + – admin asked Apr 11, 2019 • edited Apr 11, 2019 by Lakshman Bhaiya admin 106 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.