Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1998: Mathematical Foundations of Computer Science 1998 pp 248–256Cite as

On one-pass term rewriting

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1450))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Avenhaus. Reduktionssysteme. Springer, 1995.

    Google Scholar 

  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.

    Google Scholar 

  3. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, volume B of Handbook of Theoretical Computer Science, chapter 6, pages 243–320. Elsevier, 1990.

    Google Scholar 

  4. A. Deruyver and R. Gilleron. The reachability problem for ground TRS and some extensions. In TAPSOFT'89, LNCS 351. Springer, 1989, 227–243.

    Google Scholar 

  5. 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.

    Article  MATH  MathSciNet  Google Scholar 

  6. F. Gécseg and M. Steinby. Tree automata. Akadémiai Kiadó, Budapest, 1984.

    MATH  Google Scholar 

  7. F. Gécseg and M. Steinby. Tree Languages, volume 3 of Handbook of Formal Languages, chapter 1, pages 1–68. Springer, 1997.

    Google Scholar 

  8. R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In STACS'91, LNCS 480. Springer, 1991, 148–159.

    Google Scholar 

  9. R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundam. Inf., 24(1,2):157–175, 1995.

    MATH  MathSciNet  Google Scholar 

  10. D. Hofbauer and M. Huber. Linearizing term rewriting systems using test sets. J. Symb. Comput., 17(1):91–129, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  11. G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. Inf. Comput., 118(1):91–100, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  12. 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.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, József Attila University, P. O. Box 652, H-6701, Szeged, Hungary

    Zoltán Fülöp

  2. Turku Centre for Computer Science, DataCity, Lemminkäisenkatu 14 A, FIN-20520, Turku, Finland

    Eija Jurvanen

  3. Turku Centre for Computer Science, and Department of Mathematics, University of Turku, FIN-20014, Turku, Finland

    Magnus Steinby

  4. Department of Applied Informatics, József Attila University, P. O. Box 652, H-6701, Szeged, Hungary

    Sándor Vágvölgyi

Authors
  1. Zoltán Fülöp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eija Jurvanen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Magnus Steinby
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sándor Vágvölgyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luboš Brim Jozef Gruska Jiří Zlatuška

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation