(1) From the options given below, the pair having different expressive power is (A) Deterministic Push Down Automata (DPDA) and Non-deterministic Push Down Automata (NPDA) (B) Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata(NFA) (C) Single tape turning machine and multi tape turning machine. (D) Deterministic single tape turning machine […]

THEORY OF COMPUTATION EXCLUSIVE QUESTIONS THEORY OF COMPUTATION SET – 1 THEORY OF COMPUTATION SET – 2 THEORY OF COMPUTATION SET – 3 THEORY OF COMPUTATION SET – 4 THEORY OF COMPUTATION SET- 5 THEORY OF COMPUTATION SET- 6