a-b-c

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 : abc((dbc)*+(febc)*)fg it will go from a-b-c, then it can branch as...