Automatic structures of bounded degree revisited

Abstract The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic structure of bounded degree is decidable in doubly exponential space (for injective automatic presentations, this holds even uniformly). This result is shown to be optimal since we also present a string automatic structure of bounded degree whose first-order theory is hard for 2EXPSPACE. We prove similar results also for tree automatic structures. These findings close the gaps left open in [28] by improving both the lower and the upper bounds.

[1]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[2]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

[3]  A. K. Chandra,et al.  Alternation , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[4]  Bernard R. Hodgson.  On Direct Products of Automaton Decidable Theories , 1982, Theor. Comput. Sci..

[5]  C. Ward Henson,et al.  A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories , 1990, Ann. Pure Appl. Log..

[6]  Helmut Seidl,et al.  Single-Valuedness of Tree Transducers is Decidable in Polynomial Time , 1992, Theor. Comput. Sci..

[7]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[8]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[9]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[10]  Sasha Rubin,et al.  Graphs with Automatic Presentations over a Unary Alphabet , 2001, J. Autom. Lang. Comb..

[11]  Sasha Rubin,et al.  Some results on automatic structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[12]  Automatic Structures of Bounded Degree , 2003, LPAR.

[13]  Sasha Rubin,et al.  On automatic partial orders , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[14]  Thomas Schwentick,et al.  Definable relations and first-order query languages over strings , 2003, JACM.

[15]  Frank Stephan,et al.  Definability and Regularity in Automatic Structures , 2004, STACS.

[16]  Pedro V. Silva,et al.  A Geometric Characterization of Automatic Monoids , 2004 .

[17]  Andreas Weber,et al.  On the valuedness of finite transducers , 1990, Acta Informatica.

[18]  Vince Bárány.  Invariants of Automatic Presentations and Semi-synchronous Transductions , 2006, STACS.

[19]  Christof Löding,et al.  Transforming structures by set interpretations , 2007, Log. Methods Comput. Sci..

[20]  Vince Bárány,et al.  Automatic presentations of infinite structures , 2007 .

[21]  Stephan Kreutzer,et al.  Model Theory Makes Formulas Large , 2007, ICALP.

[22]  D. Kuske,et al.  First-order and counting theories of ω-automatic structures , 2008, Journal of Symbolic Logic.

[23]  Cardinality and counting quantifiers on omega-automatic structures , 2008, STACS.

[24]  Greg Hjorth,et al.  From Automatic Structures to Borel Structures , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[25]  Sasha Rubin,et al.  Automata Presenting Structures: A Survey of the Finite String Case , 2008, Bulletin of Symbolic Logic.

[26]  Markus Lohrey,et al.  Some natural decision problems in automatic graphs , 2010, J. Symb. Log..

[27]  Sasha Rubin,et al.  Automata-based presentations of infinite structures , 2011, Finite and Algorithmic Model Theory.