🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← 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?

  1. A.There can be several with different numbers of states
  2. B.It is unique up to renaming of states
  3. C.It always has 2ⁿ states
  4. 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 →