Discussion
Which of the following is decidable ?
Answer: C
The decidable problem is EQUIVALENCE OF DFA.
Whether two DFAs accept the same language can be decided: minimise both and compare them, or build a DFA for the symmetric difference of their languages and test it for emptiness, which is a simple reachability check.
The halting problem for Turing machines is the classic undecidable problem. Emptiness and equivalence of Turing machines are undecidable as well, by Rice's theorem, since each asks a non-trivial question about the language a TM accepts.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development