Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Match the following :
| (i) Regular Grammar | (a) Pushdown Automaton |
| (ii) Context free Grammar | (b) Linear bounded automaton |
| (iii) Unrestricted Grammar | (c) Deterministic finite automaton |
| (iv) Context Sensitive Grammar | (d) Turing machine |
1
i - c, ii - a, iii - b, iv - d
2
i - c, ii - a, iii - d, iv - b
3
i - c, ii - b, iii - a, iv - d
4
i - c, ii - b, iii - d, iv - a
5
Question Not Attempted