Deterministic finite automata (DFA) (have odd length or end with aaa)

2.6k Views Asked by At

Is my attempt is true or where am I wrong?

DFA : The set of strings over $\{a, b\} $ that have odd length or end with $aaa$.

My attempt

1

There are 1 best solutions below

5
On

Your automaton is correct but it is not minimal. The minimal automaton only has 5 states. Actually, you can obtain it by minimising your automaton. You will then identify states 2 and 4, states 3 and 5 and states 6 and 8.