Consider the language L1- L2- L3 as given below-L1- 0p 1q - p- q- 0 L2- 0p 1q - p- q- 0 and p-qL3- 0p 1q 0r- p- q- r- 0 and p-q-rWhich of the following statements is NOT true-

Language L_1 is regular since, it represents 0^p 1^q Language nbsp;L_2 is CFL since, it involves one comparison, two comparison at a time. Hence, option (a) i ...

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

Byju's Answer

Standard IX

Mathematics

Property 6

Consider the ...

Question

Consider the language $L_{1}, L_{2}, L_{3}$ as given below:
$L_{1} = {0^{p} 1^{q} | p, q \geq 0}$
$L_{2} = {0^{p} 1^{q} | p, q \geq 0 and p = q}$
$L_{3} = {0^{p} 1^{q} 0^{r} | p, q, r \geq 0 and p = q = r}$
Which of the following statements is NOT true?

Open in App

Solution

Language $L_{1}$ is regular since, it represents $0^{p} 1^{q}$
Language $L_{2}$ is CFL since, it involves one comparison, two comparison at a time.
Hence, option (a) is true since PDA can be used to reco and CFL respectively.
Clearly, option (c) is false.

Suggest Corrections

Similar questions

Q. Consider the following languages:

L_{1} = {0^{p} 1^{q} 0^{r} | p, q, r \geq 0}

L_{2} = {0^{p} 1^{q} 0^{r} | p, q, r \geq 0, p \neq r}

Which one of the following statements is FALSE?

Q. Consider the languages L1, L2 and L3 are given below:
L1 = {

0^{p} 1^{q} | p, q ϵ N

},
L2 = {

0^{p} 1^{q} | p, q ϵ N

and p = q} and
L3 = {

0^{p} 1^{q} 0^{r} | p, q, r ϵ N

and p = q = r}
Which of the following statements is NOT TRUE?

Q. Consider the following languages

L_{1}

0^{p} 1^{q} 0^{r} | p, q, r \geq 0

}

L_{2}

0^{p} 1^{q} 0^{r} | p, q, r \geq 0, p \neq r

}
Which one of the following statements is FALSE?

Join BYJU'S Learning Program

Consider the language L1, L2, L3 as given below: L1={0p 1q | p, q≥0} L2={0p 1q | p, q≥0 and p=q} L3={0p 1q 0r| p, q, r≥0 and p=q=r} Which of the following statements is NOT true?

Language L1 is regular since, it represents 0p 1q Language L2 is CFL since, it involves one comparison, two comparison at a time. Hence, option (a) is true since PDA can be used to reco and CFL respectively. Clearly, option (c) is false.

Consider the language $L_{1}, L_{2}, L_{3}$ as given below:
$L_{1} = {0^{p} 1^{q} | p, q \geq 0}$
$L_{2} = {0^{p} 1^{q} | p, q \geq 0 and p = q}$
$L_{3} = {0^{p} 1^{q} 0^{r} | p, q, r \geq 0 and p = q = r}$
Which of the following statements is NOT true?

Language $L_{1}$ is regular since, it represents $0^{p} 1^{q}$
Language $L_{2}$ is CFL since, it involves one comparison, two comparison at a time.
Hence, option (a) is true since PDA can be used to reco and CFL respectively.
Clearly, option (c) is false.