The language L = (0n 1n 2n where n > 0) is a

www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Theory of Computation
54

Theory of Computation MCQ with Answers

54) The language L = (0n 1n 2n where n > 0) is a

context free language

context-sensitive language

regular language

recursive enumerable language

Answer is:

context-sensitive language

Theory of Computation MCQ with Answers

For more MCQ's Click Here

55) Context free language are closed under

union, intersection

union, kleene closure

intersection, complement

complement, kleene closure

Answer is:

union, kleene closure

56) If G = ({S}, {a}, {S -> SS), S), then language generated by G is

L (G) = φ

L(G) = an

L (G) = a*

L (G) = anban

Answer is:

L (G) = φ

57) Grammar
S —> a,
S —> A3A4,
A3 —> A1, A3, A2,
A3 —>A1A2,A1
A2—> aA2A1 ,
A1a —> a A1,
A2a —> aA2,
A1A4 —>A4a,
A2A4 —> A5a,
A2A5 —> A5a,
A5 —> a generates

an^2

n2a

2an

none of these

Answer is:

an^2

58) If L1 = {x | x is a palindrome in (0 + 1)}
L2 = {letter (letter + digit) };
L3 = (0n1n 2n| n > 1}
L4 = {ambnam+n| m, n > 1}
then which of the following statement is incorrect ?

L1 is context free language and L3 is context sensitive language

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

Both L1 and L2 are regular sets

Both L3 and L4 are context-sensitive languages

Answer is:

L1 is context free language and L3 is context sensitive language

Theory of Computation MCQ with Answers

For more MCQ's Click Here

54) The language L = (0n 1n 2n where n > 0) is a

context-sensitive language

Theory of Computation MCQ with Answers

Related Theory of Computation MCQ with Answers

55) Context free language are closed under

union, kleene closure

56) If G = ({S}, {a}, {S -> SS), S), then language generated by G is

L (G) = φ

57) Grammar S —> a, S —> A3A4, A3 —> A1, A3, A2, A3 —>A1A2,A1 A2—> aA2A1 , A1a —> a A1, A2a —> aA2, A1A4 —>A4a, A2A4 —> A5a, A2A5 —> A5a, A5 —> a generates

an^2

58) If L1 = {x | x is a palindrome in (0 + 1)*} L2 = {letter (letter + digit)* }; L3 = (0n1n 2n| n > 1} L4 = {ambnam+n| m, n > 1} then which of the following statement is incorrect ?

L1 is context free language and L3 is context sensitive language

Theory of Computation MCQ with Answers

57) Grammar
S —> a,
S —> A3A4,
A3 —> A1, A3, A2,
A3 —>A1A2,A1
A2—> aA2A1 ,
A1a —> a A1,
A2a —> aA2,
A1A4 —>A4a,
A2A4 —> A5a,
A2A5 —> A5a,
A5 —> a generates

58) If L1 = {x | x is a palindrome in (0 + 1)}
L2 = {letter (letter + digit) };
L3 = (0n1n 2n| n > 1}
L4 = {ambnam+n| m, n > 1}
then which of the following statement is incorrect ?