Theory Of Computation MCQ - Context free languages

1. Home
2. Computer Science MCQ
3. Theory Of Computation MCQ
4. Context free languages

56:  

Context-free grammar can be recognized by

A.	finite state automation
B.	2-way linear bounded automata
C.	push down automata
D.	both (b) and (c)
	Answer Report Discuss
	Option: D Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

57:  

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

A.	context free language
B.	context-sensitive language
C.	regular language
D.	recursive enumerable language
	Answer Report Discuss
	Option: B Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

58:  

Context free language are closed under

A.	union, intersection
B.	union, kleene closure
C.	intersection, complement
D.	complement, kleene closure
	Answer Report Discuss
	Option: B Explanation : For Reference Click Here Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

59:  

 If G = ({S}, {a}, {S -> SS), S),

then language generated by G is

A.	L (G) =  φ
B.	L(G) = an
C.	L (G) =  a*
D.	L (G) = anban
	Answer Report Discuss
	Option: A Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

60:  

Grammar
S —> a,
S —> A₃A₄ ,
 A₃ —> A₁, A₃, A₂ ,
A₃ —> A₁ A_2, A₁
A₂—> aA₂A₁ ,
 A₁a —> a A₁, 
A₂a —> aA₂, 
A₁A₄ —> A₄a,
A₂A₄ —> A₅a, 
A₂A₅ —> A₅a,
A₅ —> a
                         generates

A.	an^2
B.	n2a
C.	2an
D.	none of these
	Answer Report Discuss
	Option: A Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

• «
• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• 11
• 12
• 13
• »