## Exercise 1›:

Minimum DFA for $\{ w \in \{a,b\}^* \mid |w|_a\in\dot{2} \}$
Describe the minimum DFA that recognizes the language of the words over $\{a,b\}$ which have an even number of $a$’s.
Authors: Guillem Godoy / Documentation:
 // In the first problem on DFAs we directly propose a solution, // in order to show which is the syntax to represent DFAs. You // just have to uncomment (remove //) the following three lines // and submit: // // a b // q1 q2 q1 + // q2 q1 q2 // // Note that the input alphabet is {a,b} and that the automaton // only has two states, named q1 and q2, where q1 is the initial // state (since it appears first) and is accepting (since it is // marked with the symbol +). // The transitions of the automaton are defined as a matrix. In // this example, by reading 'a' from state q1 it changes to state // q2, while reading 'b' keeps it in state q1. In the case of q2, // by reading 'a' it changes to q1, while reading 'b' keeps it in // q2. To be able to submit you need to either log in, register, or become a guest.