Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by cspsunny
0
votes
1
GATE CSE 1990 | Question: 3-vi
Recursive languages are: A proper superset of context free languages. Always recognizable by pushdown automata. Also called type $0$ languages. Recognizable by Turing machines.
Recursive languages are:A proper superset of context free languages.Always recognizable by pushdown automata.Also called type $0$ languages.Recognizable by Turing machine...
16.8k
views
answered
Oct 30, 2018
Theory of Computation
gate1990
normal
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
multiple-selects
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register