Intermediate
Theory of Computation
Q78 / 100
Which of the following problems about finite automata is decidable?
Correct! Well done.
Incorrect.
The correct answer is B) Whether two given DFAs recognize the same language (DFA equivalence)
B
Correct Answer
Whether two given DFAs recognize the same language (DFA equivalence)
Explanation
DFA equivalence is decidable: minimize both DFAs (or build a product DFA checking the symmetric difference) and compare; if no string is accepted by exactly one, they are equivalent. This contrasts sharply with the undecidable equivalence problem for Turing machines.
Progress
78/100