Decidability and closure properties of equational tree languages

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

Volumn 2378, Issue , 2002, Pages 114-128

  Ohsaki, Hitoshi ^a  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY;

AC-TREE AUTOMATA; CLOSURE PROPERTY; COMPLEXITY ISSUES; CONGRUENCE CLOSURE; EMPTINESS PROBLEM; EQUATIONAL TREE AUTOMATA; REACHABILITY PROBLEM; TERM REWRITING;

FORESTRY;

EID: 84947242793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45610-4_9     Document Type: Conference Paper

References (25)

1. B. Bogaert and S. Tison: Equality and Disequality constraints on Direct Subterms in Tree Automata, Proc. of 9th STACS, Cachan (France), LNCS 577, pp. 161–171 1992.
2. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi: Tree Automata Techniques and Applications, draft, 1999. Available on http://www.grappa.univ-lille3.fr/tata/
3. A. Deruyver and R. Gilleron: The Reachability Problem for Ground TRS and Some Extensions, Proc. of 14th CAAP, Barcelona (Spain), LNCS 351, pp. 227–243, 1989.
4. J. Esparza: Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes, Fundamenta Informaticae 31(1), pp. 13–25, 1997.
5. M.R. Garey and D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman & Company, New York, 1979.
6. F. Gécseg and M. Steinby: Tree Automata, Akadémiai Kiadó, Budapest, 1984.
7. T. Genet and F. Klay: Rewriting for Cryptographic Protocol Verification, Proc. of 17th CADE, Pittsburgh (PA), LNCS 1831, pp. 271–290, 2000.
8. J.E. Hopcroft and J.D. Ullman: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing Company, 1979.
9. H. Hosoya, J. Vouillon and B.C. Pierce: Regular Expression Types for XML, Proc. of 5th ICFP, Montreal (Canada), SIGPLAN Notices 35(9), pp. 11–22, 2000.
10. Y. Kaji, T. Fujiwara and T. Kasami: Solving a Unification Problem under Constrained Substitutions Using Tree Automata, JSC 23(1), pp. 79–117, 1997.
11. M. Kudlek and V. Mitrana: Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Macrosets, Multiset Processing, LNCS 2235, pp. 135–146, 2001.
12. S. LaTorre and M. Napoli: Timed Tree Automata with an Application to Temporal Logic, Acta Informatica 38(2), pp. 89–116, 2001.
13. D. Lugiez: A Good Class of Tree Automata and Application to Inductive Theorem Proving, Proc. of 25th ICALP, Aalborg (Denmark), LNCS 1443, pp. 409–420, 1998.
14. D. Lugiez and J.L. Moysset: Tree Automata Help One to Solve Equational Formulae in AC-Theories, JSC 18(4), pp. 297–318, 1994.
15. E.W. Mayr: An Algorithm for the General Petri Net Reachability Problem, SIAM J. Comput. 13(3), pp. 441–460, 1984.
16. R. Mayr and M. Rusinowitch: Reachability is Decidable for Ground AC Rewrite Systems, Proc. of 3rd INFINITY, Aalborg (Denmark), 1998. Draft available from http://www.informatik.uni-freiburg.de/˜mayrri/ac.ps
17. R. Mayr and M. Rusinowitch: Process Rewrite Systems, Information and Computation 156, pp. 264–286, 1999.
18. J. Millen and V. Shmatikov: Constraint Solving for Bounded-Process Cryptographic Protocol Analysis, Proc. of 8th CCS, Philadelphia (PA), pp. 166–175, 2001.
19. D. Monniaux: Abstracting Cryptographic Protocols with Tree Automata, Proc. of 6th SAS, Venice (Italy), LNCS 1694, pp. 149–163, 1999.
20. H. Ohsaki: Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories, Proc. of 15th CSL, Paris (France), LNCS 2142, pp. 539–553, 2001.
21. R.J. Parikh: On Context-Free Languages, JACM 13(4), pp. 570–581, 1966.
22. X. Rival and J. Goubault-Larrecq: Experiments with Finite Tree Automata in Coq, Proc. of 14th TPHOLs, Edinburgh (Scotland), LNCS 2152, pp. 362–377, 2001.
23. B. Schneier: Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition, John Wiley & Sons, 1996.
24. H. Seki, T. Takai, Y. Fujinaka and Y. Kaji: Layered Transducing Term Rewriting System and Its Recognizability Preserving Property, Proc. of 13th RTA, Copenhagen (Denmark), 2002. To appear in LNCS.
25. T. Takai, Y. Kaji and H. Seki: Right-Linear Finite-Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability, Proc. of 11th RTA, Norwich (UK), LNCS 1833, pp. 246–260, 2000.