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
26

Theory of Computation MCQ with Answers

26) If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?

L1L2

L1 ∩L2

L1 ∩R

L1 ∪L2

Answer is:

L1 ∩L2

Theory of Computation MCQ with Answers

For more MCQ's Click Here

27) Consider a grammar with the following productions
S--> aab | bac | aB
S --> αS | b
S --> αb b | ab
Sα --> bdb | b
The above grammar is

Context free

regular

context sensitive

LR ( k )

Answer is:

context sensitive

28) What can be said about a regular language L over {a} whose minimal finite state automation has two states?

L must be {an| n is odd}

L must be {an |n is even}

L must be {an| > 0}

Either L must be {an| n is odd}, or L must be {an| n is even}

Answer is:

L must be {an |n is even}

29) In a context-sensitive grammar, number of grammar symbols on the left hand side of a production can't be greater than the number of

grammar symbols on the right hand side

terminals on the right hand side

non-terminals on the right hand side

all of these

Answer is:

non-terminals on the right hand side

30) In a context-free grammar

ε can't be the right hand side of any production

terminal symbols can't be present in the left hand side of any production

number of grammar symbols in the left hand side is not greater than the number of grammar symbols in the right hand side

all of these

Answer is:

all of these

Theory of Computation MCQ with Answers

For more MCQ's Click Here

26) If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?

L1 ∩L2

Theory of Computation MCQ with Answers

Related Theory of Computation MCQ with Answers

27) Consider a grammar with the following productions S--> aab | bac | aB S --> αS | b S --> αb b | ab Sα --> bdb | b The above grammar is

context sensitive

28) What can be said about a regular language L over {a} whose minimal finite state automation has two states?

L must be {an |n is even}

29) In a context-sensitive grammar, number of grammar symbols on the left hand side of a production can't be greater than the number of

non-terminals on the right hand side

30) In a context-free grammar

all of these

Theory of Computation MCQ with Answers

27) Consider a grammar with the following productions
S--> aab | bac | aB
S --> αS | b
S --> αb b | ab
Sα --> bdb | b
The above grammar is