AMA University Answers
Login
Register
AMA OED
Courses
CS
CS-6205
What kind of languages does a...
What kind of languages does a TM decide?
regular expression
context-sensitive
recursively enumerable
Correct
context-free
Similar CS-6205 questions
What can be said about undecidable problems?
Which among the following is the option for the given grammar? G->X111|G1,X->X0|00
Which of the following statements are for a concept called inherent ambiguity in CFL?
What is the final result after converting the following NFA-ε to NFA without Null move.
What concept did Alan Turing introduce?
What cannot be said about automata theory?