Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Match List-I with List-II :
|
LIST - I |
LIST - II |
||
|
A. |
A → aB ∣ a, a ∈ T, A, B ∈ V. |
I. |
Recursive Descent Parser |
|
B. |
A → BC ∣ a, a ∈ T, A, B, C ∈ V |
II. |
Turing Machine |
|
C. |
LL (1) grammar |
III. |
Choamsky Normal Form |
|
D. |
Halting problem |
IV. |
Finite Automate |
Choose the correct answer from the options given below :
1
A - IV, B - III, C - I, D - II
2
A - III, B - I, C - II, D - IV
3
A - II, B - IV, C - III, D - I
4
A - IV, B - III, C - II, D - I