How do I convert the following GNFA to regular expression?
Given an NFA, we can simplify it to an equivalent NFA with possibly fewer states by repeatedly applying the following two pruning steps:


Remove any states which are not reachable from the initial state.
Remove any states from which no final state can be reached.


In your case, this will result in removing the left bottom state.