Monotone AC-tree automata

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

Volumn 3835 LNAI, Issue , 2005, Pages 337-351

  Ohsaki, Hitoshi ^a   Talbot, Jean Marc ^b   Tison, Sophie ^b   Roos, Yves ^b  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b UNIV LILLE   (France)

Author keywords

Closure properties; Complexity; Decidability; Equational tree automata

Indexed keywords

CLOSURE PROPERTIES; DECIDABILITY; EQUATIONAL TREE AUTOMATA;

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

AUTOMATA THEORY;

EID: 33745479339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_24     Document Type: Conference Paper

References (32)

1. A. Armando, D. Basin, M. Bouallagui, Y. Chevalier, L. Compagna, S. Mödersheim, M. Rusinowitch, M. Turuani, L. Viganò, and L. Vigneron. The AVISS Security Protocol Analysis Tool. In Proc. of 14th CAV, Copenhagen (Denmark), volume 2404 of LNCS, pages 349-353. Springer, 2002.
2. I. Boneva and J.-M. Talbot. Automata and Logics for Unranked and Unordered Trees. In Proc. of 16th RTA, Nara (Japan), volume 3467 of LNCS, pages 500-515. Springer, 2005.
3. A. Bouhoula, J. P. Jouannaud, and J. Meseguer. Specification and Proof in Membership Equational Logic. TCS, 236:35-132, 2000.
4. T. Colcombet. Rewriting in the Partial Algebra of Typed Terms Modulo AC. In Proc. of 4th INFINITY, Brno (Czech Republic), volume 68(6) of ENTCS. Elsevier, 2002.
5. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications, 2002. (http://www.grappa.univ-lille3.fr/tata).
6. N. Dershowitz and R. Treinen. Problem #101. The RTA List of Open Problems. Available at http://www.lsv.ens-cachan.fr/rtaloop/.
7. P. Devienne, J.-M. Talbot, and S. Tison. Set-Based Analysis for Logic Programming and Tree Automata. In Proc. of 4th SAS, volume 1302 of LNCS, pages 127-140. Springer, 1997.
8. J. Esparza. Decidability and Complexity of Petri Net Problems - An Introduction. In Petri Nets, Dagstuhl (Germany), volume 1491 of LNCS, pages 374-428. Springer, 1996.
9. J. Esparza. Decidability of Model-Checking for Infinite-State Concurrent Systems. Acta Informatica, 34:85-107, 1997.
10. J. Esparza. Grammars as Processes. In Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg, volume 2300 of LNCS, pages 277-297. Springer, 2002.
11. J. P. Gallagher and G. Puebla. Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. In Proc. of 4th PADL, Portland (USA), volume 2257 of LNCS, pages 243-261. Springer, 2002.
12. T. Genet and F. Klay. Rewriting for Cryptographic Protocol Verification. In Proc. of 17th CADE, Pittsburgh (USA), volume 1831 of LNCS, pages 271-290. Springer, 2000.
13. S. Ginsburg. The Mathematical Theory of Context-Free Languages. McGraw-Hill, 1966.
14. J. Goubault-Larrecq and K.M. Verma. Alternating Two-way AC-Tree Automata. Technical Report LSV-02-11, Laboratoire Spécification et Vèrification, 2002.
15. D. Hauschildt. Semilinearity of the Reachability Set is Decidable for Petri Nets. Technical Report FBI-HH-B-146/90, Universität Hamburg, 1990.
16. J. Hendrix, H. Ohsaki, and J. Meseguer. Sufficient Completeness Checking with Propositional Tree Automata. Technical Report AIST-PS-2005-013, National Institute of Advanced Industrial Science and Technology, 2005. (http://staff.aist.go.jp/hitoshi.ohsaki/).
17. H. Hosoya, J. Vouillon, and B. C. Pierce. Regular Expression Types for XML. In Proc. of 5th ICFP, Montreal (Canada), volume 35(9) of SIGPLAN Notices, pages 11-22. ACM, 2000.
18. N. D. Jones, L. H. Landweber, and Y. E. Lien. Complexity of Some Problems in Petri Nets. TCS, 4(3):277-299, 1977.
19. M. Kudlek and V. Mitrana. Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages. In Multiset Processing, volume 2235 of LNCS, pages 135-146. Springer, 2001.
20. S. Y. Kuroda. Classes of Languages and Linear Bounded Automata. Information and Control, 7(2):207-223, 1964.
21. D. Lugiez. Counting and Equality Corstraints for Multitree Automata. In Proc. of 6th FOSSACS, Warsaw (Poland), volume 2620 of LNCS, pages 328-342. Springer, 2003.
22. Y. Matiyasevich. Enumerable Sets are Diophantine. Doklady Akademii Nauk SSSR, 191(2):279-282, 1970 (in Russian).
23. Improved and English translation in Soviet Mathematics Doklady, 11:354-357.
24. H. Ohsaki. Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories. In Proc. of 15th CSL, volume 2142 of LNCS, pages 539-553. Springer, 2001.
25. H. Ohsaki, H. Seki, and T. Takai. Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism. In Proc. of 14th RTA, Valencia (Spain), volume 2706 of LNCS, pages 483-498. Springer, 2003.
26. H. Ohsaki and T. Takai. Decidability and Closure Properties of Equational Tree Languages. In Proc. of 13th RTA, Copenhagen (Denmark), volume 2378 of LNCS, pages 114-128. Springer, 2002.
27. H. Ohsaki and T. Takai, ACTAS: A System Design for Associative and Commutative Tree Automata Theory. In Proc. of 5th RULE, Aachen (Germany), volume 124(1) of ENTCS, pages 97-111. Elsevier, 2005.
28. R.J. Parikh. On Context-Free Languages. JACM, 13(4):570-581, 1966.
29. W. Savitch. Relationships between Nondeterministic and Deterministic Tape Complexities. Journal of Computer and Systems Sciences, 4(2):177-192, 1970.
30. H. Seidl, T. Schwentick, and A. Muscholl, Numerical Document Queries. In Proc. of 22nd PODS, San Diego (USA), pages 155-166. ACM, 2003.
31. K. N. Verma. On Closure under Complementation of Equational Tree Automata for Theories Extending AC. In Proc. of 10th LPAR, volume 2850 of LNCS, pages 183-197. Springer, 2003.
32. K. N. Verma. Two-Way Equational Tree Automata for AC-like Theories: Decidability and Closure Properties. In Proc. of 14th RTA, Valencia (Spain), volume 2706 of LNCS, pages 180-197. Springer, 2003.