← All topics
Quiz: DFA: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. In a DFA, how many transitions leave each state on each input symbol?
- Q2. Using the ends-in-01 DFA, what is the path for input 1101?
- Q3. In the divisible-by-3 DFA, from remainder 2, reading bit 1 goes to remainder:
- Q4. How many states does a minimal DFA need for "binary strings with exactly two 1s"?
- Q5. How do you build a DFA for the intersection of two regular languages?
- Q6. In the 5-tuple (Q, Σ, δ, q₀, F), what does F stand for?
- Q7. What is a dead (trap) state?
- Q8. What does this print? (code)
- Q9. How do you build a DFA for the complement of a language, given a complete DFA for it?
- Q10. What is the minimum number of states in a DFA for binary strings whose length is divisible by 4?