Skip to main content
Computer Science

Return to Question

Commonmark migration
Source Link
Community Bot
Community Bot
  • 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" below## DFA that accepts any string that contains substring "abc"

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"

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"

added 1 character in body
Source Link
Peter Yakob
Peter Yakob
  • 41
  • 1
  • 1
  • 6

So I have been trying to create a Deterministic Finite AutomataAutomaton(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"

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? My DFA

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

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"

deleted 138 characters in body
Source Link
Peter Yakob
Peter Yakob
  • 41
  • 1
  • 1
  • 6

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? My DFA

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

##Final DFA## DFA that accepts all strings except those that contain substring "abc"

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? My DFA

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

##Final DFA## DFA that accepts all strings except those that contain substring "abc"

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? My DFA

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

Post Closed as "Duplicate" by D.W.♦
Added the solution to my problem (Image 3)
Source Link
Peter Yakob
Peter Yakob
  • 41
  • 1
  • 1
  • 6
Added new image of a automata that excepts all strings that contains substring "abc"
Source Link
Peter Yakob
Peter Yakob
  • 41
  • 1
  • 1
  • 6
Cropped image
Source Link
Evil
Evil
  • 9.5k
  • 11
  • 32
  • 52
Source Link
Peter Yakob
Peter Yakob
  • 41
  • 1
  • 1
  • 6