Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Consider the following language families:
A. Recursively enumerable language B. Deterministic context free language
C. Context sensitive language D. Recursive language
E. Context free language
Which of the following options correctly describes the relationship and containment between these language families?
1
E ⊆ B ⊆ C ⊆ D ⊆ A
2
E ⊆ B ⊆ C ⊆ A ⊆ D
3
B ⊆ E ⊆ C ⊆ A ⊆ D
4
B ⊆ C ⊆ E ⊆ A ⊆ D
5
Question Not Attempted