The Complexity of Checking Non-Emptiness in Symbolic Tree Automata

Abstract

We study the satisfiability problem of symbolic tree automata and decompose it into the satisfiability problem of the existential first-order theory of the input characters and the existential monadic second-order theory of the indices of the 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

arXiv admin note: substantial text overlap with arXiv:2307.00151