Computer-Graphics
January 1, 2025Theory-of-Computation
January 3, 2025Theory-of-Computation
|
Question 18
|
Consider the languages L1,L2 and L3 as given below.
- L1 = {0p1q|p,q∈N},
L2 = {0p1q|p,q∈N and p=q} and
L3 = {0p1q0r|p,q,r∈N and p=q=r}.
Which of the following statements is NOT TRUE?
|
Push Down Automate (PDA) can be used to recognize L1 and L2
|
|
|
L1 is a regular language
|
|
|
All the three languages are context free
|
|
|
Turing machines can be used to recognize all the languages
|
Question 18 Explanation:
L1: regular language
L2: context free language
L3: context sensitive language
L2: context free language
L3: context sensitive language
Correct Answer: C
Question 18 Explanation:
L1: regular language
L2: context free language
L3: context sensitive language
L2: context free language
L3: context sensitive language