Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Consider the following language families:
L1 ≡ The context – free languages
L2 ≡ The context – sensitive languages
L3 ≡ The recursively enumerable languages
L4 ≡ The recursive languages
Which one of the following options is correct?
1
L1 ⊆ L2 ⊆ L3 ⊆ L4
2
L2 ⊆ L1 ⊆ L3 ⊆ L4
3
L1 ⊆ L2 ⊆ L4 ⊆ L3
4
L2 ⊆ L1 ⊆ L4 ⊆ L3