Tree Automata for Non-linear Arithmetic

Tree automata modulo associativity and commutativity axioms, called AC tree automata, accept trees by iterating the transition modulo equational reasoning. The class of languages accepted by monotoneAC tree automata is known to include the solution set of the inequality $x \times y \geqslant z$, which implies that the class properly includes the AC closure of regular tree languages. In the paper, we characterize more precisely the expressiveness of monotone AC tree automata, based on the observation that, in addition to polynomials, a class of exponential constraints (called monotone exponential Diophantine inequalities) can be expressed by monotone AC tree automata with a minimal signature. Moreover, we show that a class of arithmetic logic consisting of monotone exponential Diophantine inequalities is definable by monotone AC tree automata. The results presented in the paper are obtained by applying our novel tree automata technique, called linearly bounded projection.

[1]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[2]  Lawrence Landweber.  Properties of Vector Addition Systems , 1975 .

[3]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[4]  Hitoshi Ohsaki,et al.  Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories , 2001, CSL.

[5]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[6]  Victor Mitrana,et al.  Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages , 2000, WMP.

[7]  Denis Lugiez,et al.  XML schema, tree logic and sheaves automata , 2003, Applicable Algebra in Engineering, Communication and Computing.

[8]  Jean-Marc Talbot,et al.  Monotone AC-Tree Automata , 2005, LPAR.

[9]  Hiroyuki Seki,et al.  Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism , 2003, RTA.

[10]  Eric van der Vlist,et al.  XML Schema , 2002 .

[11]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[12]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[13]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[14]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[15]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[16]  Peter G. Hinman,et al.  Fundamentals of Mathematical Logic , 2018 .

[17]  Jean-Marc Talbot,et al.  Automata and Logics for Unranked and Unordered Trees , 2005, RTA.

[18]  Thomas Schwentick,et al.  Numerical document queries , 2003, PODS.

[19]  Jean Goubault-Larrecq,et al.  Alternating two-way AC-tree automata , 2007, Inf. Comput..

[20]  Jean-Marc Talbot,et al.  Expressiveness of spatial logic for trees , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[21]  Yuri Matiyasevich,et al.  Hilbert’s tenth problem , 2019, 100 Years of Math Milestones.

[22]  Denis Lugiez,et al.  Multitree automata that count , 2005, Theor. Comput. Sci..

[23]  James W. Thatcher,et al.  Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..