Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.47K Points
Coach 

Q.) Which of the following problem is undecidable?

(A) Membership problem for CFL
(B) Membership problem for regular sets
(C) Membership problem for CSL
(D) Membership problem for type 0 languages
Correct answer : Option (D) - Membership problem for type 0 languages

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. 7n test cases are generated in which case of Boundary Value Analysis?

Q. Database __________ which is the logical design of the database, and the database _______ which is a snapshot of the data in the database at a given instant in time.

Q. RTP is used to

Q. A distributed system is defined as a collection of autonomous computers linked by a network with software designed to produce an integrated computing facility.

Q. The size of the graph matrix is

Q. A job interview is a formal meeting between a job seeker and an employer.

Q. MyISAM, InnoDB, TRANSACTION

Q. Following acts as detector in Optical sensor

Q. What is the main goal of software testing?

Q. Each entry in a linked list is a called a_______________.