← Quiz: DFA Minimisation (Table Filling): all 10 questions
Quiz: DFA Minimisation (Table Filling) · Question 9 of 10
Which statement about the minimal DFA of a regular language is true?
Which statement about the minimal DFA of a regular language is true?
- A.There can be several with different numbers of states
- B.It is unique up to renaming of states
- C.It always has 2ⁿ states
- D.It must have exactly one accepting state
Answer & explanation
Correct answer: It is unique up to renaming of states
This uniqueness (from Myhill–Nerode) is why minimising both DFAs is a valid equivalence test.
Can you get the rest right without peeking?
Take the timed Quiz: DFA Minimisation (Table Filling) quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →