Multitree automata that count

Theoretical Computer Science

Volumn 333, Issue 1-2, 2005, Pages 225-263

  Lugiez, Denis ^a  

^a CNRS   (France)

Author keywords

Formal languages; Logic; Presburger arithmetic; Tree automata

Indexed keywords

COMPUTER SCIENCE; CONSTRAINT THEORY; FORMAL LANGUAGES; SURFACE TOPOGRAPHY; THEOREM PROVING; TREES (MATHEMATICS); XML;

LOGIC; MULTISETS; PRESBURGER ARITHMETIC; TREE-AUTOMATA;

AUTOMATA THEORY;

EID: 13644264988     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.023     Document Type: Conference Paper

References (29)

1. F. Baader, and T. Nipkow Term Rewriting and All That 1998 Cambridge University Press Cambridge
2. D. Benanav, D. Kapur, P. Narendran, Complexity of matching problems, in: Proc. 1st Internat. Conf. on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, Vol. 202, Springer, Berlin, 1985, pp. 417-429.
3. L. Berman Precise bounds for Presburger arithmetic and the reals with addition preliminary report Proc. 18th Symp. on Foundation of Computer Science (FOCS) 1977 IEEE Computer Society Silver Spring, MD 95 99
4. B. Bogaert, S. Tison, Equality and disequality constraints on direct subterms in tree automata, in: Proc. 9th Symp. on Theoretical Computer Science (STACS), Lecture Notes in Computer Science, Vol. 577, Springer, Berlin, 1992, pp. 161-172.
5. V. Bruyere, G. Hansel, C. Michaux, and R. Villemaire Logic and p-recognizable sets of integers Bull. Belgian Math. Soc. 1 1994 191 238
6. A.C. Caron, H. Comon, J.L. Coquidé, M. Dauchet, F. Jacquemard, Pumping, cleaning and symbolic constraints solving, in: Proc. 21st Internat. Colloq. on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science, Vol. 820, Springer, Berlin, 1994, pp. 436-449.
7. Th. Colcombet Rewriting in the partial algebra of typed terms modulo AC Electron. Notes Theoret. Comput. Sci. 68 2002
8. H. Comon, F. Jacquemard, Ground reducibility and automata with disequality constraints, in: Proc. 11th Symp. on Theoretical Computer Science (STACS), Lecture Notes in Computer Science, Vol. 820, Springer, Berlin, 1994, pp. 151-162.
9. S. DalZilio, D. Lugiez, XML schema, tree logic and sheaves automata, in: Proc. 14th Internat. Conf. on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, Vol. 2706, Springer, Berlin, 2003, pp. 246-253.
10. L. Dickson Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors Amer. J. Math. 35 1913 113 122
11. S. Feferman, R.L. Vaught, The first-order properties of products of algebraic systems, Fund. Math. (1959) 57-103.
12. J. Ferrante, C.W. Rackoff, The computational Complexities of Logical Theories, Lecture Notes in Mathematics, Vol. 718, Springer, Berlin, 1978.
13. M.J. Fischer, M.O. Rabin, Super-exponential complexity of Presburger arithmetic, in: Complexity of Computation, SIAM-AMS Proc., Vol. 7, 1974, pp. 27-41.
14. S. Ginsburg Mathematical Theory of Context-free Languages 1966 Mc-Graw-Hill New York
15. S. Ginsburg, and E. Spanier Semigroups, Presburger formulas and languages Pacific J. Math. 16 1966 285 296
16. J. Goubault-Larrecq, K.N. Verma, Alternating two-way AC-tree automata, Technical Report 02-11, LSV, ENS Cachan, September 2002.
17. F. Klaedtke, H. Rueß, Parikh automata and monadic second-order logics with linear cardinality constraints, Technical Report 177, Albert-Ludwigs-Universität Freiburg, July 2002.
18. O. Kupferman, U. Sattler, M.Y. Vardi, The complexity of the graded mu-calculus, in: Proc. 18th Conf. on Automated Deduction (CADE), Lecture Notes in Computer Science, Vol. 2392, Springer, Berlin, 2002, pp. 423-437.
19. D. Lugiez, A good class of tree automata, in: Proc. 25th Internat. Colloq. on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998, pp. 409-420.
20. D. Lugiez, Counting and equality constraints for multitree automata, in: Proc. 6th Conf. on Foundations of Software Science and Computational Structures (FOSSACS),Lecture Notes in Computer Science, Vol. 2620, Springer, Berlin, 2003, pp. 328-342.
21. D. Lugiez, and J.L. Moysset Tree automata help one to solve equational formulae in AC-theories J. Symbolic Comput. 18 4 1994 297 318
22. F. Maurin The theory of integer multiplication with order restricted to primes is decidable J. Symbolic Logic 62 1 1997 123 130
23. M. Murata, Extended path expression for XML, in: Proc. 20th Symp. on Principles of Database Systems (PODS), ACM Press, New York, 2001, pp. 126-137.
24. A. Muscholl, T. Schwentick, H. Seidl, Numerical document queries, in: Proc. 22nd ACM Symp. on Principles of Database Systems (PODS), ACM Press, New York, 2003, pp. 155-166.
25. J. Niehren, A. Podelski, Feature automata and recognizable sets of feature trees, in: Proc. 4th Internat. Conf. on Theory and Practice of Software Development (TAPSOFT), Lecture Notes in Computer Science, Vol. 668, Springer, Berlin, 1993, pp. 356-375.
26. H. Ohsaki, Beyond the regularity: equational tree automata for associative and commutative theories, in: Proc. 15th Internat. Workshop Computer Science Logic, (CSL), Lecture Notes in Computer Science, Vol. 2142, Springer, Berlin, 2001, pp. 539-553.
27. C. Pair, and A. Quéré Définition et étude des bilangages réguliers Inform. Control 13 6 1968 565 593
28. K.N. Verma, Automates d'arbres bidirectionnels modulo théories équationnelles, Ph.D. Thesis, ENS-Cachan, September 2003, http://www.lsv.ens-cachan.fr/Publis/PAPERS/Verma-these.ps.
29. K.N. Verma, Two-way equational tree automata for AC-like theories; decidability and closure properties, in: Proc. 14th Internat. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, Vol. 2706, Springer, Berlin, 2003, pp. 180-196.