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...
Hi Guest we just wanted to alert you to a major change in the forum. We will no longer be allowing the posting of outgoing links. Please use the attachment feature to attach media to your posts.