This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Avenhaus. Reduktionssysteme. Springer, 1995.
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.
N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, volume B of Handbook of Theoretical Computer Science, chapter 6, pages 243–320. Elsevier, 1990.
A. Deruyver and R. Gilleron. The reachability problem for ground TRS and some extensions. In TAPSOFT'89, LNCS 351. Springer, 1989, 227–243.
J. Engelfriet and E. M. Schmidt. IO and OI. Part I. J. Comput. Syst. Sci., 15(3):328–353, 1977. Part II. J. Comput. Syst. Sci., 16(1):67–99, 1978.
F. Gécseg and M. Steinby. Tree automata. Akadémiai Kiadó, Budapest, 1984.
F. Gécseg and M. Steinby. Tree Languages, volume 3 of Handbook of Formal Languages, chapter 1, pages 1–68. Springer, 1997.
R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In STACS'91, LNCS 480. Springer, 1991, 148–159.
R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundam. Inf., 24(1,2):157–175, 1995.
D. Hofbauer and M. Huber. Linearizing term rewriting systems using test sets. J. Symb. Comput., 17(1):91–129, 1994.
G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. Inf. Comput., 118(1):91–100, 1995.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fülöp, Z., Jurvanen, E., Steinby, M., Vágvölgyi, S. (1998). On one-pass term rewriting. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055774
Download citation
DOI: https://doi.org/10.1007/BFb0055774
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive