  We study the satisfiability problem of symbolic finite automata and decompose
it into the satisfiability problem of the theory of the input characters and
the monadic second-order theory of the indices of accepted words. We use our
decomposition to obtain tight computational complexity bounds on the decision
problem for this automata class and an extension that considers linear
arithmetic constraints on the underlying effective Boolean algebra.
