Multiple Choice
Which one of the following is true regarding FOTRAN?
A) It is a context free language
B) It is a context sensitive language
C) It is a regular language
D) None of the above
Correct Answer:
Verified
Correct Answer:
Verified
Q39: If PCP is decidable then MPCP is<br>A)Decidable<br>B)Undecidable<br>C)Can't
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
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)