Skip to main content
SpringerLink
Log in

On the regular structure of prefix rewriting

  • Conference paper
  • First Online:
CAAP '90 (CAAP 1990)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-M. Autebert ‘Langages algébriques', Ed. Masson.

    Google Scholar 

  2. J.C.M. Baeten, J.A. Bergstra, J.W. Klop ‘Decidability of bisimulation equivalence for processes generating context-free languages', LNCS 259, pp 94–111.

    Google Scholar 

  3. M. Bauderon, ‘On systems of equations defining infinite graphs', LNCS 344, pp 54–73.

    Google Scholar 

  4. M. Bauderon, ‘Infinite hypergraphs: basic properties and systems of equations’, Internal report I-8920.

    Google Scholar 

  5. J. Berstel ‘Transductions and context-free languages', Ed. Teubner.

    Google Scholar 

  6. L. Boasson, M. Nivat ‘Centers of context-free languages', Report LITP 84-44.

    Google Scholar 

  7. R. Büchi ‘Regular canonical systems', Archiv für Mathematische Logik und Grundlagenforschung 6, pp 91–111.

    Google Scholar 

  8. D. Caucal ‘Récritures suffixes de mots', Report Inria 871.

    Google Scholar 

  9. D. Caucal ‘On the regular structure of prefix rewriting', Internal report 507.

    Google Scholar 

  10. B. Courcelle ‘The monadic second-order logic of graphs, II: Infinite graphs of bounded width', Math. Syst. Theory 21, pp 187–222.

    Google Scholar 

  11. B. Courcelle ‘The definability of equational graphs in monadic second-order logic', Icalp, LNCS 372, pp 207–221.

    Google Scholar 

  12. M. Dauchet, S. Tison, T. Heuillard, P. Lescanne ‘The confluence of ground term rewriting systems is decidable’ Preliminary proceeding of the conference on resolution of equations in algebraic structures. Austin.

    Google Scholar 

  13. A. Habel, H.J. Kreowski 'some structural aspects of hypergraph languages generated by hyperedge replacement', LNCS 247, pp 207–219.

    Google Scholar 

  14. G. Huet, D. Lankford ‘On the uniform halting problem for term rewriting systems’ Report INRIA 283.

    Google Scholar 

  15. D. Muller, P. Schupp ‘The theory of ends, pushdown automata, and second order logic', TCS 37, pp 51–75.

    Google Scholar 

  16. G. Nelson, D. Oppen ‘Fast decision procedures based on congruence closure’ JACM 27-2, pp 356–364.

    Google Scholar 

  17. J. Sakarovitch 'syntaxe des langages de Chomsky. Essai sur le déterminisme', Thèse d'état, LITP.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, Campus de Beaulieu, F35042, Rennes-Cedex, France

    Didier Caucal

Authors
  1. Didier Caucal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Arnold

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caucal, D. (1990). On the regular structure of prefix rewriting. In: Arnold, A. (eds) CAAP '90. CAAP 1990. Lecture Notes in Computer Science, vol 431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52590-4_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-52590-4_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52590-5

  • Online ISBN: 978-3-540-47042-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation