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
34

Theory of Computation MCQ with Answers

34) Let L be a language recognizable by a finite automaton. The language
REVERSE (L) = {w such that w is the reverse of v where v ∈L } is a

regular language

context-free language

context-sensitive language

recursively enumerable language

Answer is:

regular language

Theory of Computation MCQ with Answers

For more MCQ's Click Here

Related Theory of Computation MCQ with Answers

35) The grammars G = ( { s }, { 0, 1 }, p , s) where p = (s —> 0S1, S —> OS, S —> S1, S —>0} is a

recursively enumerable language

regular language

context-sensitive language

context-free language

Answer is:

regular language

36) The logic of pumping lemma is a good example of

pigeon-hole principle

divide-and-conquer technique

recursion

iteration

Answer is:

pigeon-hole principle

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

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

Theory of Computation MCQ with Answers

For more MCQ's Click Here