Given language L={ w ∈ {a, b, c}* | w does not contain aaa as substring and w must contain aa as sufix}.
I tested this words:
aa correct aaa fail baa correct caa correct abaa correct acaa correct accccccaa correct aaacaa fail bbaaa fail abcaa correct aabcaa correct
My DFA:
There's some case I'm missing?