I have got a problem working on a deterministic finite automaton.
I have got 2 alphabets $\Sigma_a = \{a_1,a_2,a_3...,a_n\}$ and $\Sigma_b = \{b_1,b_2,b_3...,b_n\}$ the automaton should match a alphabet: $\Sigma = \Sigma_a \cup \Sigma_b$ in mathematic: \begin{align} L_a &= \{w ∈ Σ^* \mid \exists\ 1 \leqslant i_1 < i_2 < ... < i_n \leqslant |w| : w_{i_1}w_{i_2} \dotsm w_{i_n} = a\}\\ L_b &= \{w ∈ Σ^* \mid \exists\ 1 \leqslant i_1 < i_2 < ... < i_m \leqslant |w| : w_{i_1}w_{i_2} \dotsm w_{i_m} = b\} \end{align} for example: $a_1,a_2,a_3,b_1,b_2,b_3$ but also $a_1,b_1,a_2,b_2$. the alphabets should be ascending.
I have no idea how do describe this in a mathematic formula. Or even draw the automaton for $|a| = |b| = 3$. I tried it but this automaton has unbelievable many states.
greets.