Multiple choice

Consider the languages $L1, :L2 :and : L3$ as given below.

$L1={0^p 1^q \mid p, q \in N}, \\ L2 = {0^p 1^q \mid p, q \in N :and :p=q} : and \\ L3 = {0^p 1^q 0^r \mid p, q, r \in N: and : p=q=r}.$

Which of the following statements is NOT TRUE?

  1. Push Down Automata (PDA) can be used to recognize L1 and L2

  2. L1 is a regular language

  3. All the three languages are context free

  4. Turing machines can be used to recognize all the languages

Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

L1: regular language L2: context free language L3: context sensitive language