Consider the following language families : L ≡ The context - free languages 1 L ≡ The context - sensitive languages 2 L 3 ≡ The recursively enumerable languages L ≡ The recursive languages 4 Which one of the following options is correct? L ⊆ L ⊆ L ⊆ L

1. A1 2 3 4 L ⊆ L ⊆ L ⊆ L
2. B2 1 3 4 L ⊆ L ⊆ L ⊆ L
3. C1 2 4 3 L ⊆ L ⊆ L ⊆ L
4. D2 1 4 3

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: C. 1 2 4 3 L ⊆ L ⊆ L ⊆ L

Explanation

Context-free ⊆ context-sensitive ⊆ recursive ⊆ recursively enumerable: L1 ⊆ L2 ⊆ L4 ⊆ L3.