Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) Which of the following statement is true?

(A) All languages can be generated by CFG
(B) The number of symbols necessary to simulate a Turing Machine(TM) with m symbols and n states is mn.
(C) Any regular languages have an equivalent CFG.
(D) The class of CFG is not closed under union.
Correct answer : Option (C) - Any regular languages have an equivalent CFG.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. A larger cloud network can be built as either a layer 3 or layer 4 network.

Q. Which type of graph has all the vertex of the first set connected to all the vertex of the second set?

Q. A directed complete graph of n vertices contains __________.

Q. Logic X-OR operation of (4ACO)H & (B53F)H results

Q. . …………………… among the following was the first to identify four functions of management.

Q. Which one is not a size measure for software

Q. Data Manipulation Language enables users to

Q. What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x))

Q. Type HTC applications are?

Q. Common gateway interface is used to _______