1
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
Which of the following are decidable?
$$1.$$ Whether the intersection of two regular languages 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$$
2
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statements is false?
A
The halting problem for Turing machine is un-decidable
B
Determining whether ambiguity a context free grammar is un-decidable
C
Given two arbitrary context free grammars $${G_1}$$ and $${G_2}$$ whether $$L\left( {{G_1}} \right) = L\left( {{G_2}} \right)$$
D
Given two regular grammars $${{G_1}}$$ and $${{G_2}},$$ it is un-decidable whether $$L\left( {{G_1}} \right) = L\left( {{G_2}} \right)$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12