Q26MCQ2 marks, −0.67Consider the languages L1, L2 and L3L1, \:L2 \:and \: L3L1,L2andL3 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}.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\}.L1={0p1q∣p,q∈N},L2={0p1q∣p,q∈Nandp=q}and,L3={0p1q0r∣p,q,r∈Nandp=q=r}. Which of the following statements is NOT TRUE?(A)Push Down Automata (PDA) can be used to recognize L1L1L1 and L2L2L2(B)L1L1L1 is a regular language(C)All the three languages are context free(D)Turing machines can be used to recognize all the languagesSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google