On one-pass term rewriting

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

Volumn 1450 LNCS, Issue , 1998, Pages 248-256

  Fülöp, Zoltán ^a   Jurvanen, Eija ^b   Steinby, Magnus ^c   Vágvölgyi, Sándor ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

^b TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^c UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84896692991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055774     Document Type: Conference Paper

References (13)

1. J. Avenhaus. Reduktionssysteme. Springer, 1995.
2. M. Dauchet and F. De Comite. A gap between linear and non-linear term-rewriting systems. In RTA-87, LNCS 256. Springer, 1987, 95-104.
3. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, volume B of Handbook of Theoretical Computer Science, chapter 6, pages 243-320. Elsevier, 1990.
4. A. Deruyver and R. Gilleron. The reachability problem for ground TRS and some extensions. In TAPSOFT'89, LNCS 351. Springer, 1989, 227-243.
5. J. Engelfriet and E. M. Schmidt. IO and OI. Part I. J. Comput. Syst. Sci., 15(3):328-353, 1977
6. Part II. J. Comput. Syst. Sci, 16(1):67-99, 1978.
7. F. Gécseg and M. Steinby. Tree automata. Akadémiai Kiadó, Budapest, 1984.
8. F. Gécseg and M. Steinby. Tree Languages, Volume 3 of Handbook of Formal Languages, chapter 1, pages 1-68. Springer, 1997.
9. R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In STACS'91, LNCS 480. Springer, 1991, 148-159.
10. R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundam. Inf., 24(1, 2):157-175, 1995.
11. D. Hofbauer and M. Huber. Linearizing term rewriting systems using test sets. J. Symb. Comput, 17(1):91-129, 1994.
12. G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. Inf. Comput, 118(1):91-100, 1995.
13. S. Vágvölgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible, ground terms is recognizable. Bull. EATCS, 48:197-209, 1992.