So I have been trying to create a Deterministic Finite Automata(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?
3 of 7
Added new image of a automata that excepts all strings that contains substring "abc"
Peter Yakob
- 41
- 1
- 1
- 6
DFA - Accept all strings that does not contain a certain substring
Peter Yakob
- 41
- 1
- 1
- 6