Beginner
Theory of Computation
Q26 / 100
What is the state minimization of a DFA?
Correct! Well done.
Incorrect.
The correct answer is B) Finding the unique smallest equivalent DFA by merging indistinguishable states
B
Correct Answer
Finding the unique smallest equivalent DFA by merging indistinguishable states
Explanation
The minimized DFA (Myhill-Nerode theorem) is unique and has the fewest states. States are merged if they are indistinguishable (same behavior on all input suffixes).
Progress
26/100