- For each accepting state q, apply the reduction process to produce an equivalent automaton with regular expression labels on the arcs. Eliminate all states except q and the start state q0. 2. If q 6= q0, then we shall be left with a two-state automata: U Start S T R One regular expression that describes the accepted strings: (R +SU∗T)∗SU∗ 3.
For More Information Please Refer:
You May Also Like to Read:
What happens when fsm1 accepts a reversed string?