Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Match List I with List II:
| List I | List II | ||
| (A) | Type 0 | (I) | Finite automata |
| (B) | Type 1 | (II) | Tuning machine |
| (C) | Type 2 | (III) | Linear bound automata |
| (D) | Type 3 | (IV) | Pushdown automata |
Choose the correct answer from the options given below:
1
(A) - (III), (B) - (IV), (C) - (II), (D) - (I)
2
(A) - (II), (B) - (III), (C) - (IV), (D) - (I)
3
(A) - (III), (B) - (IV), (C) - (I), (D) - (II)
4
(A) - (II), (B) - (III), (C) - (II), (D) - (IV)