Multiple Choice
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:

Verified
Correct Answer:
Verified
Q40: The PDA is called non-deterministic PDA when
Q41: FSM can recognize<br>A)Any grammar<br>B)Only CG<br>C)Both (a) and
Q42: Consider the following Finite State Automaton The
Q43: PCP is:<br>A)Decidable<br>B)Undecidable<br>C)Sometimes Decidable<br>D)None of the
Q44: Which one of the following is true
Q45: Recursively enumerable languages are not closed under<br>A)Union<br>B)homomorphism<br>C)complementation<br>D)concatenation
Q46: Given A = {0,1} and L =
Q47: A minimum state deterministic finite automation accepting
Q48: Let L={w (0 + 1)* w has
Q49: Which of the following statements is/are FALSE?<br>(1)