Start at the accepting states with empty regexes, then do a reverse graph traversal. Use regex concatenation for each transition, and regex alternation if there are multiple outgoing edges. If you find a circle, add a repetition. After having assigned a regex to each state, use the regex of the start state. Could that work?
For More Information Please Refer:
You May Also Like to Read: