Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Berman. Precise bounds for Presburger arithmetic and the reals with addition: Preliminary report. In Proc. of Symp. on Foundation Of Computer Science, pages 95–99, 1977.
Dan Benanav, Deepak Kapur, and Paliath Narendran. Complexity of matching problems. In Proc. of 1st Int. Conf. on Rewriting techniques and Applications, vol. 202 of Lect. Notes in Comp. Sci., pages 417–429, 1985.
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Proc. of the 9th STACS, vol. 577 of Lect. Notes in Comp. Sci., pp. 161–172, 1992.
A.C. Caron, H. Comon, J.L. Coquidé, M. Dauchet, and F. Jacquemard. Pumping, cleaning and symbolic constraints solving. In Proc. 21st ICALP, Jerusalem (Israel), pages 436–449, 1994.
H. Comon and F. Jacquemard. Ground reducibility and automata with disequality constraints. In Springer-Verlag, editor, Proc. of 11th STACS, vol. 820 of Lect. Notes in Comp. Sci., pages 151–162, 1994.
Th. Colcombet. Rewriting in partial algebra of typed terms modulo aci. presented at the Infinity workshop, August 2002.
S. DalZilio and D. Lugiez. Multitrees automata,Presburger’s constraints and tree logics. Tech. Report 4631, INRIA, 2002.
J. Goubault-Larrecq and K.N. Verma. Alternating two-way AC-tree automata. Technical report, LSV, ENS Cachan, 2002.
D. Lugiez and J.L. Moysset. Tree automata help one to solve equational formulae in AC-theories. Journal of Symbolic Computation, 18(4):297–318, 1994.
D. Lugiez. A good class of tree automata. In K. Larsen, S. Skyum, and G. Winskel, editors, Proc. of 15th ICALP, vol. 1443 of Lect. Notes in Comp. Sci., pages 409–420. Springer-Verlag, 1998.
Makoto Murata. Extended path expression for XML. In ACM, editor, Proc. of the 20th Symp. on Principles of Database Systems (PODS), Santa Barbara, USA, 2001. ACM.
Joachim Niehren and Andreas Podelski. Feature automata and recognizable sets of feature trees. In Proc. TAPSOFT’93, vol. 668 of Lect. Notes in Comp. Sci., pages 356–375, 1993.
Hitoshi Ohsaki. Beyond the regularity: Equational tree automata for associative and commutative theories. In CSL 2001, vol. 2142 of Lect. Notes in Comp. Sci.. Springer-Verlag, 2001.
C. Pair and A. Quéré. Définition et étude des bilangages réguliers. Information and Control, 13(6):565–593, 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lugiez, D. (2003). Counting and Equality Constraints for Multitree Automata. In: Gordon, A.D. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2003. Lecture Notes in Computer Science, vol 2620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36576-1_21
Download citation
DOI: https://doi.org/10.1007/3-540-36576-1_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00897-2
Online ISBN: 978-3-540-36576-1
eBook Packages: Springer Book Archive