Deterministic finite automaton (DFA) for regular expression $(a|(bc)^n)^m$

119 Views Asked by At

I constructed a machine for the regular expression $(a|(bc)^n)^m$ where $n,m > 0$. I would be very interested in a correction of the machine, or is the machine in its form correct?

My DFA:

enter image description here

Thanks for your suggestions!

1

There are 1 best solutions below

0
On

Your automata matches the regex given. It is acceptable to leave out trash states with the understanding that they are implicit.