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
39

Theory of Computation MCQ with Answers

39) Context free grammar is not closed under

product

union

complementation

kleen star

Answer is:

complementation

Theory of Computation MCQ with Answers

For more MCQ's Click Here

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

42) Consider the following grammar
S --> Ax / By
A --> By/Cw
B --> x / Bw
C--> y
Which of the regular expressions describe the same set of strings as the grammar ?

xw * y + xw * yx + ywx

xwy + xw * xy + ywx

xw * y + xw x yx + ywx

xw xy + xww * y + ywx

Answer is:

xw * y + xw * yx + ywx

43) Which of the following statements is (are) correct ?

Recursive languages are closed under complementation.

If a language and its complement are both regular, the language is recursive

Set of recursively enumerable language is closed under union

All of these

Answer is:

All of these

Theory of Computation MCQ with Answers

For more MCQ's Click Here

39) Context free grammar is not closed under

complementation

Theory of Computation MCQ with Answers

Related Theory of Computation MCQ with Answers

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

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

Both 1) Designing computers and 2) Designing compilers

42) Consider the following grammar S --> Ax / By A --> By/Cw B --> x / Bw C--> y Which of the regular expressions describe the same set of strings as the grammar ?

xw * y + xw * yx + ywx

43) Which of the following statements is (are) correct ?

All of these

Theory of Computation MCQ with Answers

42) Consider the following grammar
S --> Ax / By
A --> By/Cw
B --> x / Bw
C--> y
Which of the regular expressions describe the same set of strings as the grammar ?