AMA University Answers
Login
Register
AMA OED
Courses
CS
CS-6205
What is an undecidable problem...
What is an undecidable problem?
When a TM cannot make a decision on an instance of the problem
Correct
When a CFG cannot make a decision on an instance of the problem
When a PDA cannot make a decision on an instance of the problem
When a RE cannot make a decision on an instance of the problem
Similar CS-6205 questions
What is a Universal TM?
What kind of languages does a TM decide?
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.