1

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"

Community
  • 1
Peter Yakob
  • 31
  • 1
  • 1
  • 5

1 Answers1

2

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

Community
  • 1
Peter Yakob
  • 31
  • 1
  • 1
  • 5
  • By the way "automata" is plural, "automaton" is singular. – Evil Feb 09 '17 at 20:26
  • is this the only automaton that accepts all string combinations of the language{a,b,c} that do not contain the substring "abc" ?? for example in state $q1$ when the input is c , would it make a difference to have an edge pointing to $q1$ instead of $q_0$ ?? – tonythestark Oct 27 '20 at 17:40