I'm a bit new to automata theory, I'm sorry if this question is a bit too simple. If this question has been answered somewhere already, please point me to it.
One basic problem I wanted to solve was defining the minimal set of states need to construct a (minimal) DFA that accepts
I'm not sure how to treat the OR operator here, though.
I assume it means I can accept either ($a^+$) OR $bcd^*$ OR both (but in the given order), but does it mean I can ignore the order as well (meaning that, e.g. $bcdddaa$ would be acceptable as well)?
If anyone could explain, I would appreciate it. I understand the meaning of other operators.