Rewriting in the partial algebra of typed terms modulo AC

Electronic Notes in Theoretical Computer Science

Volumn 68, Issue 6, 2003, Pages 40-54

  Colcombet, Thomas ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES; GRAPHIC METHODS; MATHEMATICAL OPERATORS; PETRI NETS; SET THEORY; THEOREM PROVING;

GROUND REWRITE SYSTEMS; IDEMPOTENT OPERATORS; PARTIAL ALGEBRA; RATIONAL LANGUAGES;

LINEAR ALGEBRA;

EID: 18944381535     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80532-2     Document Type: Conference Paper

References (15)

1. Caucal D. On infinite transition graphs having a decidable monadic theory. ICALP'96 volume 1099 of LNCS. 1996;194-205
2. D. Caucal. On infinite terms having a decidable monadic theory. In MFCS'02, 2002.
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
4. Courcelle B. The monadic second-order logic of graphs, ii: Infinite graphs of bounded width. Mathematical Systems Theory. 21:1989;187-222
5. Courcelle B. The monadic second order logic of graphs ix: Machines and their behaviours. Theoretical Computer Science. volume 151:1995;125-162
6. M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Fifth Annual IEEE Symposium on Logic in Computer Science, pages 242-248, 1990.
7. M. Hack. The recursive equivalence of the reachability problem and the liveness problem for petri nets and vector addition systems. In 15th annual symposium on switching and automata theory, New York, 1974.
8. Knapik T., Niwinski D., Urzyczyn P. Higher-order pushdown trees are easy. Nielsen M. FOSSACS'02, LNCS. 2002
9. S. Kosaraju. Decidability of reachability in vector addition systems. In 14th Annual Symposium on Theory of Computing, 1982.
10. Lugiez D., Moysset J.-L. Complement problems and tree automata in aclike theories. Enjalbert P., Finkel A., Wagner K.W. STACS'93. volume 665:February 1993;515-524 LNCS, Würzburg (Germany)
11. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. In Proc. 9th Int. Conf. Concurrency Theory (CONCUR'98), Nice, France, Sep. 1998, volume 1466, pages 50-66. Springer, 1998.
12. Mayr E. An algorithm for the general petri net reachability problem. SIAM Journal on computing. 13:1981;441-460
13. Mayr R. Process rewrite systems. Information and Computation. 156:(1):2000;264-286
14. Muller D., Schupp P. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science. 37:1985;51-75
15. Spanier E., Ginsburg S. Semigroups, presburger formulas and languages. Pacific J. Maths. 16:1996;285-296