Conisder the following languages -L1 - ww - w - a - L2 - ww - w - a b-Which of the above languages in non - regular but CFL -

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

Conisder the ...

Question

Conisder the following languages :

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

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

Which of the above languages in non - regular but CFL ?

Open in App

Solution

Suggest Corrections

Similar questions

\sum = {a, b} L_{1} = {w w | w \in {a, b} *} L_{2} = complement of L_{1} L_{3} = L_{1} \cup L_{2}

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}

1. A = w w^{r} w^{r} w | w \in Σ^{*}

2. B = {w w^{r} x x^{r} | w, x \in Σ^{*}}

3. C = a^{i} b^{j} a^{k} b^{l} | = | i, j, k, l \geq 0, (i + j) = (k + l)

L_{1}

w w^{R}

w \in

{(0, 1)}^{*}

L_{2}

w \neq w^{R}

w \in

{(0, 1)}^{*}

\neq

L_{3}

w w

w \in

{(0, 1)}^{*}

\sum

L_{1}

0^{n} 1^{n} | n \geq 0

L_{2}

w c w^{r} | w ϵ

L_{3}

w w^{r} | w ϵ

w^{r}

Join BYJU'S Learning Program