← All topics
Quiz: DFA Minimisation (Table Filling): questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. In the table-filling method, which pairs are marked in round 0?
- Q2. Why is state D removed before filling the table in the example?
- Q3. An unmarked pair (p, q) goes on symbol 1 to the pair (C, F), which is marked. What do you do?
- Q4. How many states does the minimal DFA for the 8-state example have?
- Q5. A pair is first marked in round 2. What is the length of its shortest distinguishing string?
- Q6. What does this print? (code)
- Q7. For n reachable states, how many cells does the triangular table have?
- Q8. The equivalence checker returns (False, "01") for two DFAs. What does that mean?
- Q9. Which statement about the minimal DFA of a regular language is true?
- Q10. What is the main mistake in this reasoning: "δ(p, 0) = B and δ(q, 0) = H are different states, so mark (p, q)"?