Which of the following problems are undecidable?
PYQ GATE 1989
Which of the following problems are undecidable?
- A.
Membership problem in context-free languages.
- B.
Whether a given context-free language is regular.
- C.
Whether a finite state automation halts on all inputs.
- D.
Membership problem for type languages.
Attempted by 35 students.
Sign up free to check your answer
Sign up freeLoading lesson…

