This DFA accepts any string over the alphabet {a, b} where the number of 'b's, if present, is even. An example of strings it accept: Accepted: a aa bb aaa abb bab bba aaa abb bab bba aaaa aaab aabab baaab aabab baaab babaa bbaaa aaabab aaaa aabab bbaaa bbbb aaaa
Ive tried dfas with states, 3 states, I just can't get it to work.