#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

Having the initial state as a final state, give the deterministic finite state automaton that accepts the regular expression.

Answer

((a.b)+c)*