GATE CSE 2012 | Question: 24 (Here "Which of the following problems are decidable" is asked)

Dark Mode

[closed]

62 views

1 vote

Best answer

- The given problem is reducible to the halting problem of turning the machine, so UNDECIDABLE.
- This is an Undecidable problem. (https://cs.stackexchange.com/questions/132411/deciding-whether-complement-of-context-free-language-is-context-free)

Not closed does not mean Undecidable.(https://gateoverflow.in/78060/undecidability)

C. It’s Trivial. So decidable.

D. It’s Trivial. So decidable