Home / Engineering / Theory of Computation and Compiler Design / Question

M

Mr. Dubey • 51.62K Points
Coach

Q.) Which of the following are decidable ?
1. whether the intersection of two regular language is infinite.
2. whether a give 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

Discusssion

Login to discuss.