Any Language generated by an unrestricted grammar is:

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) Any Language generated by an unrestricted grammar is:

(A) Recursive

(B) Recursively Enumerable

(C) Not Recursive

(D) None of the above

Correct answer : Option (A) - Recursive

Share

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. Group of assets falling within a class of assets comprising of tangible & intangible assets is known as :

Q. Which of the following creates a temporary relation for the query on which it is deﬁned?

Q. Which of the following terms does refer to the correctness and completeness of the data in a database?

Q. Which of the following is a sound rule of inference?

Q. If every node u in G is adjacent to every other node v in G, A graph is said to be _______.

Q. Which of the following is true about weighted majority votes? 1. We want to give higher weights to better performing models 2. Inferior models can overrule the best model if collective weighted votes for inferior models is higher than best model 3. Voting is special case of weighted voting

Q. ___________defines the structure of the data held in operational databases and used by operational applications.

Q. Among the logic families, the family which can be used at very high frequency greater than 100 MHz in a 4 bit

Q. The addressing mode which makes use of in-direction pointers is ______

Q. In which testing level the focus is on customer usage?