Counting and equality constraints for multitree automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2620, Issue , 2003, Pages 328-342

  Lugiez, Denis ^a  

^a UNIVERSITÉ DE PROVENCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; KNOWLEDGE REPRESENTATION;

BOOLEAN COMBINATIONS; CONCURRENT SYSTEMS; CRYPTOGRAPHIC PROTOCOLS; EMPTINESS PROBLEM; EQUALITY CONSTRAINTS; FIRST ORDER THEORIES; SCIENCE APPLICATIONS; UNORDERED TREES;

AUTOMATA THEORY;

EID: 35248882451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_21     Document Type: Article

References (15)

1. 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.
2. 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.
3. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
4. 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.
5. 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.
6. 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.
7. Th. Colcombet. Rewriting in partial algebra of typed terms modulo aci. presented at the Infinity workshop, August 2002.
8. S. DalZilio and D. Lugiez. Multitrees automata, Presburger's constraints and tree logics. Tech. Report 4631, INRIA, 2002.
9. J. Goubault-Larrecq and K.N. Verma. Alternating two-way AC-tree automata. Technical report, LSV, ENS Cachan, 2002.
10. 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.
11. 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.
12. 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.
13. 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.
14. 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.
15. C. Pair and A. Quéré. Définition et étude des bilangages réguliers. Information and Control, 13(6):565-593, 1968.