Every recursive language is
- called Type-0 language
- proper superset of context-free languages
- recognized by Turing machine
- regular language
Choose the most appropriate answer from options given below
1. A, B Only
2. A, B, C Only
3. A, B, D Only
4. B, C, D Only
1
2 (Chosen Option)
3
4