Consider the following language-L1-XYmxmym-m-0L2-X- Y- Z-XmYmZm-m-0L3- w-0-1- - K- 0 and w is a binary encoding of KThe number of the above languages which are CFL is-

L_1 is CSL. L_2 is CFL. L_2=(X^mY^nZ^p|m, n, p≤ 0 and m ≠ p} L_3 is regular.. So L_3 is nbsp; also CFL. L_3=0^∗(1+10^∗ 1) ...

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

Introduction to CFL

Consider the ...

Question

Consider the following language;
$L_{1} : {(X Y)^{m} x^{m} y^{m} | m > 0}$

$L_{2} : {X^{} Y^{} Z^{} {X^{m} Y^{m} Z^{m} | m > 0}}$

$L_{3} : {(w ϵ {0, 1}^{} | \exists K \geq 0 and w is a binary encoding of K)}$

The number of the above languages which are CFL is________.

Open in App

Solution

Suggest Corrections

Similar questions

\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}

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

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

$M = {ω ω^{R} ω ω^{R} | ω \in {(0, 1)}^{*}}$

$N = {ω_{1} ω_{1}^{R} ω_{2} {ω_{2}}^{R} | ω \in {(0, 1)}^{*}}$

L_{1} : {w x w^{R} ∣ w, x ϵ {a, b}^{*} a n d ∣ w ∣, ∣ x ∣> 0}

w^{R}

L_{2} : {a^{n} b^{m} ∣ m \neq n a n d m, n \geq 0}

L_{3} : {a^{p} b^{q} c^{r} ∣ p, q, r \geq 0}

I . {w^{R} x^{R} w^{R} y^{R} | w, x, y \in (0, 1)^{*}}

I I . {x w x^{R} | w, x \in (0, 1)^{*}}

I I I . {w, x^{R} w y^{R} | w, x, y \in (0, 1)^{*}}

I V . {w x^{R} w^{R} x | w, x, y \in (0, 1)^{*}}

Join BYJU'S Learning Program