Counting and Equality Constraints for Multitree Automata

Multitree are unranked, unordered trees and occur in many Computer Science applications like rewriting and logic, knowledge representation, XML queries, typing for concurrent systems, cryptographic protocols.... We define constrained multitree automata which accept sets of multitrees where the constraints are expressed in a first-order theory of multisets with counting formulae which is very expressive and decidable. The resulting class of multitree automata is closed under boolean combination, has a decidable emptiness problem and we show that this class strictly embeds all previous classes of similar devices which have been defined for a whole variety of applications.

[1]  Denis Lugiez,et al.  A Good Class of Tree Automata and Application to Inductive Theorem Proving , 1998, ICALP.

[2]  Leonard Berman,et al.  Precise bounds for presburger arithmetic and the reals with addition: Preliminary report , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Florent Jacquemard,et al.  Ground Reducibility and Automata with Disequality Constraints , 1994, STACS.

[4]  Thomas Colcombet.  Rewriting in the partial algebra of typed terms modulo AC , 2002, INFINITY.

[5]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[6]  Makoto Murata,et al.  Extended path expressions of XML , 2001, PODS.

[7]  Paliath Narendran,et al.  Complexity of Matching Problems , 1987, J. Symb. Comput..

[8]  Denis Lugiez,et al.  Multitrees Automata , Presburger ’ s Constraints and Tree Logics , 2022 .

[9]  Alain Quéré,et al.  Définition et Etude des Bilangages Réguliers , 1968, Inf. Control..

[10]  Sophie Tison,et al.  Equality and Disequality Constraints on Direct Subterms in Tree Automata , 1992, STACS.

[11]  Florent Jacquemard,et al.  Pumping, Cleaning and Symbolic Constraints Solving , 1994, ICALP.

[12]  Joachim Niehren,et al.  Feature Automata and Recognizable Sets of Feature Trees , 1993, TAPSOFT.

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

[14]  M. Murata.  Extended Path Expressions for XML [ Extended , 2001 .

[15]  Denis Lugiez.  A Good Class of Tree Automata , 1998 .

[16]  Denis Lugiez,et al.  Tree Automata Help One To Solve Equational Formulae In AC-Theories , 1994, J. Symb. Comput..