Consider the language L1 and L2-L1-ww-w-a-b-L2-L-1Which of the following is most strongest answer-

L_1 is well known CSL. L_2 is a CFL as there is a CFG for L_2 given below. S→ A|B|AB|BA A→ a|aAb|aAa|bAb|bAa B→ b|aBa|aBb|bBb|bBa ...

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

Introduction to CFL

Consider the ...

Question

$Consider the language L_{1} and L_{2};$
$L_{1} = {w w | w ϵ (a, b)^{*}}$
$L_{2} = {¯ L}_{1}$
Which of the following is most strongest answer?

L_{1} is C S L and L_{2} is Recursive Language

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

L_{1} is C S L and L_{2} is C F L

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

None of the above

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

Both L_{1} and L_{2} is C F L

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

Open in App

Solution

Suggest Corrections

Similar questions

L_{1} = {w w ∣ w ϵ {a, b}^{*}}

L_{2} = {w w^{R} ∣ w ϵ {a, b}^{*}, w^{R} i s t h e r e v e r s e o f w}

L_{3} = {0^{2 i} ∣ i i s a n i n t e g e r}

L_{4} = {0^{i 2} ∣ i i s a n i n t e g e r}

L_{1} : {w w | w ϵ {a}^{*}}

L_{2} : {w w | w ϵ {a b}^{*}}

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} = {L | L accepted by " PDA by final state " over Σ = {a, b}}

L_{2} = {L | L accepted by " PDA by Empty state " over Σ = {a, b}}

L_{1} \leq L_{2}

L_{2}

L_{1}

Join BYJU'S Learning Program