-1

I have the following DFA. (Yellow stated are accepting states.) I want to eliminate states step by step to find the regular expression of it.
In my steps, I think there is a bug because I do not know what to do with state 4.

enter image description here

If you know how to convert this DFA to regular expression please help me.

David Richerby
  • 82,470
  • 26
  • 145
  • 239
bsinowa
  • 33
  • 3

1 Answers1

2

From state 4 you cannot reach an accepting state. That means that state 4 does not contribute to the language of the automaton. Therefore you can simply delete it and then apply the state elimination procedure to the rest of the automaton to find the equivalent regular expression.

Hoopje
  • 1,140
  • 10
  • 15