Q. Recursive languages are (Solved)
1. A proper superset of CFL
2. Always recognized by PDA
3. Are also called type 0 languages
4. Always recognized by FSA
- a. A proper superset of CFL
1. A proper superset of CFL
2. Always recognized by PDA
3. Are also called type 0 languages
4. Always recognized by FSA