Any Language generated by an unrestricted grammar is:

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.47K 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. ________ diagram illustrates use case realizations.

Q. Where performance and reliability are both important, RAID level is used.

Q. supports low energy radio operation.

Q. Which of the following is true about good design?

Q. What is/are the main component / components of user interface ?

Q. Which of the following is a type of Architectural Model?

Q. To improve the data retrieval rate

Q. What is Test set?

Q. Which of the following statements are true for a design matrix X ∈ Rn×d with d > n? (The rows are n sample points and the columns represent d features.)

Q. One of the reasons of widespread of cloud is its ability to provide resource allocation dynamically from a pool of VM resources. State True or False.