Problem Detail: 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.
If you know how to convert this DFA to regular expression please help me.
In my steps, I think there is a bug because I do not know what to do with state 4.
If you know how to convert this DFA to regular expression please help me.
Asked By : bsinowa
Answered By : Hoopje
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.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/32260 Ask a Question Download Related Notes/Documents
