Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) Which of the following are decidable?
1) Whether the intersection of two regular language is infinite.
2) Whether a given context free language is regular.
3) Whether two push down automata accept the same language.
4) Whether a given grammar is context free.

(A) 1 and 2
(B) 1 and 4
(C) 2 and 3
(D) 2 and 4
Correct answer : Option (B) - 1 and 4

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. Which command creates database objects like tables, views and indexes:

Q. Does Raspberry Pi need external hardware?

Q. Increase in size of a convolutional kernel would necessarily increase the performance of a convolutional network.

Q. Binary circuit elements have

Q. Suppose list1 is [3, 4, 5, 20, 5, 25, 1, 3], what is list1.count(5)?

Q. What is one of the common examples of a stack?

Q. what is the relationship of a filename to its inode

Q. Which of the following protocol below are suited for email retrieval?

Q. An investigation can be hindered by the following:

Q. Snapshot of the dta in the database at a given instant of time is called