A DFA that accepts all binary
strings containing an even
number of 0s (but not ).
1
ε
even
∑ = { 0, 1 }
1
Q = { S, even, odd }.
S
0
0
0
A = { even }.
odd
S is the start state.
state
∂(state,char) is given by:
input characters
0
1
S
odd
even
even
odd
odd
odd
even
odd
1