6.1.2 Sequence

If the regular expressions of elements of a sequence are represented by DFAs M₁,M₂,…M_n, then the sequence is represented by connecting the DFAs. The accept state of one DFA connects to the start state of the following DFA using a ε transition.

In other words, if A_i represent the set of accept states of machine M_i, and s_i represent the start state of machine M_i, then ∀i ∈ [1…n− 1],a_i ∈ A_i : T(a_i,ε) = s_i+1. s₁ serves as the start state of the composite automata, where as A_n serves as the set of accept states of the composite automata.