edited by
106 views
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\}$

  1. Show that each of these languages is context-free by giving grammars for each.
  2. Is $L_{1}\cap L_{2}$ a $CFL?$ Justify your answer.
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
admin asked Apr 11, 2019
124 views
Show that the $CFL's$ are not closed under the following operations$:$$\text{min}$$\text{max}$$\text{half}$$\text{alt}$
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4