Consider the following languages- L1- anbmcn-m-m-n- 1 L2- anbnc2n-n- 1 Which one of the following is TRUE-

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Introduction to CFL

Consider the ...

Question

Consider the following languages:
$L_{1} = {a^{n} b^{m} c^{n + m} : m, n \geq 1}$
$L_{2} = {a^{n} b^{n} c^{2 n} : n \geq 1}$
Which one of the following is TRUE?

L_{2} i s c o n t e x t - f r e e w h i l e

L_{1} i s n o t c o n t e x t - f r e e

No worries! We‘ve got your back. Try BYJU‘S free classes today!

N e i t h e r L_{1} n o r L_{2} i s c o n t e x t - f r e e

No worries! We‘ve got your back. Try BYJU‘S free classes today!

L_{1}

is context-free while

L_{2} i s n o t c o n t e x t - f r e e

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

L_{1} a n d L_{2} a r e c o n t e x t - f r e e .

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

Suggest Corrections

Similar questions

L_{1} a n d L_{2}

L_{1} \cdot L_{2}

" \cdot "

L_{1} = {a^{n} | n \geq 0}

L_{2} = {b^{n} | n \geq 0}

L_{1} and L 2

L_{1}

L_{2}

D C F L .

L_{3} = (L_{1} \cap L_{2}^{*})^{'}

L_{3}

L_{1} = {a^{m} b^{n} a^{n} b^{m} | m, n \geq 1}

L_{2} = {a^{m} b^{n} a^{m} b^{n} | m, n \geq 1}

L_{3} = {a^{m} b^{n} | m = 2 n + 1}

L_{1} = {a^{n} ∣ n \geq 0}

L_{2} = {b^{n} ∣ n \geq 0}

L_{1} \cdot L_{2}

L_{1} \cdot L_{2} = {a^{n} b^{n} ∣ n \geq 0}

L_{1}

L_{2}

L_{1} \cup L_{2} .

Join BYJU'S Learning Program