All mock tests are FREE till 31 December — register to save your progress
Unit 8 · Theory of Computation and Compilers Paper 2 CS · September 2022

Match List I with List II. List I: (A) Type 0, (B) Type 1, (C) Type 2, (D) Type 3. List II: (I) Finite automata, (II) Turing machine, (III) Linear bounded automata, (IV) Pushdown automata.

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. (A)-(II), (B)-(III), (C)-(IV), (D)-(I)

Explanation

Type 0 ↔ Turing machines; Type 1 ↔ linear bounded automata; Type 2 ↔ pushdown automata; Type 3 ↔ finite automata.

More Theory of Computation and Compilers questions