If the regular expression of alternatives are represented by DFAs M1,…Mn, then the composite machine consists of a new start state s, and its set of accepts states is A1 ∪ A2 ∪…An. New transitions are created so that ∀i ∈ [1…n] : T(s,ε) = si, in which si is the start state of machine Mi.