Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.47K Points
Coach 

Q.) Context free grammar is not closed under

(A) Product operation
(B) Union
(C) Complementation
(D) kleene star
Correct answer : Option (C) - Complementation

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. What is the use of Boolean identities?

Q. init’s job after basic system initialization is

Q. What is a principal limitation of multimedia as a means for presenting educational material, according to Rogers and Aldrich (1996)?

Q. The terms "low speed" and "high speed," applied to logic circuits, refer to the

Q. The scale to measure the intensity level of sound is called

Q. Executable atomic computations are called as ________

Q. What is the fundamental insight underlying the "cognitive walk through" method of evaluation?

Q. IMS stands for?

Q. The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using

Q. The factors of and uncertainty are the deļ¬ning aspects of any engineering economic decisions