Multiple Choice
Which of the following pairs have DIFFERENT expressive power?
A) Deterministic finite automata (DFA) and Non-Deterministic finite automata(NFA)
B) Deterministic push down automata (DPDA) and Non-deterministic pushdown automata
C) Deterministic single-tape Turing machine and Non-deterministic single-tape Turing Machine
D) Single-tape Turing machine and multi-tape Turing machine
Correct Answer:

Verified
Correct Answer:
Verified
Q13: Which of the following problems is undecidable?<br>A)Membership
Q14: Let L denotes the language generated by
Q15: The following grammar G = (N, T,
Q16: Consider a string s over (0+1)*. The
Q17: If L<sub>1</sub> and L<sub>2</sub> are context free
Q19: Any Language generated by an unrestricted grammar
Q20: Context free grammar is not closed under<br>A)Product
Q21: Following syntax-directed translation scheme is used with
Q22: Let the class of language accepted by
Q23: What is the highest type number which