Skills101
← All practice quizzes

Quiz: DFA

5 questionsNo time limitPass: 60%+10 XP on first pass

Learn DFAs properly: the 5-tuple definition, state diagrams and transition tables, designing DFAs for "ends with", "contains", "divisible by 3" and counting problems, a reusable Python DFA simulator, product construction and real-world state machines.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    In a DFA, how many transitions leave each state on each input symbol?

  2. Question 2

    Using the ends-in-01 DFA, what is the path for input 1101?

  3. Question 3

    In the divisible-by-3 DFA, from remainder 2, reading bit 1 goes to remainder:

  4. Question 4

    How many states does a minimal DFA need for "binary strings with exactly two 1s"?

  5. Question 5

    How do you build a DFA for the intersection of two regular languages?