Climbing up the elementary complexity classes with theories of automatic structures

Abu Zaid, Faried GND; Kuske, Dietrich GND; Lindner, Peter

We investigate the recently introduced concept of uniformly tree-automatic classes in the realm of parameterized complexity theory. Roughly speaking, a class of finite structures is uniformly tree-automatic if it can be presented by a set of finite trees and a tuple of automata. A tree t encodes a structure and an element of this structure is encoded by a labeling of t. The automata are used to present the relations of the structure. We use this formalism to obtain algorithmic meta-theorems for first-order logic and in some cases also monadic second-order logic on classes of finite Boolean algebras, finite groups, and graphs of bounded tree-depth. Our main concern is the efficiency of this approach with respect to the hidden parameter dependence (size of the formula). We develop a method to analyze the complexity of uniformly tree-automatic presentations, which allows us to give upper bounds for the runtime of the automata-based model checking algorithm on the presented class. It turns out that the parameter dependence is elementary for all the above mentioned classes. Additionally we show that one can lift the FPT results, which are obtained by our method, from a class C to the closure of C under direct products with only a singly exponential blow-up in the parameter dependence.

Cite

Citation style:
Climbing up the elementary complexity classes with theories of automatic structures, 2018. . Computer Science Logic 2018. https://doi.org/10.4230/LIPIcs.CSL.2018.3
Could not load citation form. Default citation form is displayed.

Rights

Use and reproduction:

Export