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
37

Theory of Computation MCQ with Answers

37) The intersection of CFL and regular language

is always regular

is always context free

both (a) and (b)

need not be regular

Answer is:

is always context free

Theory of Computation MCQ with Answers

For more MCQ's Click Here

Related Theory of Computation MCQ with Answers

38) For two regular languages L1 = (a + b)* a and L2 = b (a + b ) * , the intersection of L1 and L2 is given by

(a + b ) * ab

ab (a + b ) *

a ( a + b ) * b

b (a + b ) * a

Answer is:

b (a + b ) * a

39) Context free grammar is not closed under

product

union

complementation

kleen star

Answer is:

complementation

40) If L be a language recognizable by a finite automaton, then language front {L} = { w such that w is prefix of v where v ∈L }, is a

regular language

context-free language

context-sensitive language

recursive enumeration language

Answer is:

regular language

41) For which of the following application, regular expressions can not be used ?

Designing computers

Designing compilers

Both 1) Designing computers and 2) Designing compilers

Developing computers

Answer is:

Both 1) Designing computers and 2) Designing compilers

Theory of Computation MCQ with Answers

For more MCQ's Click Here