Which of the following languages is are non-regular-L1- 0m1n- 0- m- n- 10000 L2- w- w reads the same froward and backward L3- w- 0- 1 - w contains an even number of 0-s and an even number of 1-s

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

Which of the ...

Question

Which of the following languages is (are) non-regular?

$L_{1} = {0^{m} 1^{n} ∣ 0 \leq m \leq n \leq 10000}$

$L_{2} = {w ∣ w r e a d s t h e s a m e f r o w a r d a n d b a c k w a r d}$

$L_{3} = {w ϵ {0, 1}^{*} ∣ w c o n t a i n s a n e v e n n u m b e r o f 0^{'} s a n d a n e v e n n u m b e r o f 1^{'} s}$

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} : {(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)}

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}

{w ∣ w ϵ (0, 1)^{*}}

$L_{1} = {a^{n} b^{n} | n \geq 0, n \neq 100}$

$L_{2} = {w \in {a, b, c} * | n_{a} (w) = n_{b} (w) = n_{c} (w)}$

Which of the following options is correct?

Join BYJU'S Learning Program