Recursive languages are:
PYQ GATE 1990
Recursive languages are:
- A.
A proper superset of context free languages.
- B.
Always recognizable by pushdown automata.
- C.
Also called type 0 languages.
- D.
Recognizable by Turing machines.
Attempted by 50 students.
Sign up free to check your answer
Sign up freeLoading lesson…

