1
$\begingroup$

This question already has an answer here:

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 "abc". However i keep running into issues where certain strings that should be allowed aren't, such as "acbc". Do you have any tips or tricks that can be used to get around these kind of issues? My DFA

DFA that accepts any string that contains substring "abc" below

DFA that accepts any string that contains substring "abc"

$\endgroup$

marked as duplicate by D.W. Feb 9 '17 at 20:17

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • 1
    $\begingroup$ Please post your answer as an answer! $\endgroup$ – Raphael Feb 9 '17 at 20:13
  • 1
    $\begingroup$ Your question is already covered by an answer to our reference question on the subject. I encourage you to read through the material there, as that will teach you not only how to solve this particular problem but also how to approach other similar problems in the future. $\endgroup$ – D.W. Feb 9 '17 at 20:19
1
$\begingroup$

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 "abc"

Final Automaton

enter image description here

$\endgroup$
  • $\begingroup$ By the way "automata" is plural, "automaton" is singular. $\endgroup$ – Evil Feb 9 '17 at 20:26

Not the answer you're looking for? Browse other questions tagged or ask your own question.