Eliminate all the intermediate states one by one. These states may be eliminated in any order. Only an initial state going to the final state will be left. The cost of this transition is the required regular expression. The state elimination method can be applied to any finite automata. Initial state A has an incoming edge.

For More Information Please Refer:

You May Also Like to Read: