this is the non finite automata
the one state at the top with triangle is the start state
the one on the right bottom is the end state.
i want to describe it with a regular expression.
solutions i thought of :
it will go from a-b-c, then it can branch as many times as it wants in d-b-c, or it can branch f-e-b-c, then it ends as f-g
other two possible :
()* shows that it is repeated many times , + means OR.