I want to define the language of this FSA with a regular expression. I have learned that by state-elimination, I would be able to find a regular expression.
But there are already some epsilon transitions in this FSA.
My question is:
Should I first follow the epsilon-removal construction, and then do state elimination?
Or can I use state-elimination directly on this FSA?