DFA - Accept all strings that does not contain a certain substring So I have been trying to create a Deterministic Finite Automaton(DFA) in Jflap that accepts all strings from the alphabet {a, b, c} except those that contain the substring &quot;abc&quot;. However i keep running into issues where certain strings that should be allowed aren't, such as &quot;acbc&quot;. Do you have any tips or tricks that can be used to get around these kind of issues? 
DFA that accepts any string that contains substring &quot;abc&quot; below
This is the inverted DFA of Image 2 which should accept all string combinations of the language{a,b,c} that do not contain the substring &quot;abc&quot;
Final Automaton