Theory Of Computation MCQ

1:

 If L1 = {x  | x is a palindrome in (0 + 1)*}
                 L2 = {letter (letter + digit)* };
                 L3 = (0n 1n 2n | n > 1}
                 L4 = {ambnam+n | m, n > 1}


then which of the following statement is correct ?

A.

L1 is context free language and L3 is context sensitive language

B.

L2 is a regular set and L4 is not a context free language

C.

Both L1 and L2 are regular sets

D.

Both L3 and L4 are context-sensitive languages

 

Answer : A

Explanation :

Kajal Kansal said: (12:51am on Wednesday 9th April 2014)
L1 is surely cfl and l3 is csl then how this is the right answer.i think c is the right answer as L1 is not regular set because of palindrome
Vandana said: (5:12pm on Thursday 15th February 2018)
Only option A is true , rest all 3 are false , so in question they should ask for the correct answer. Then option A will be the right choice.

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.