Table of contents

  1. Front Matter
  2. Jean-Pierre Jouannaud
    Pages 1-15
  3. Nachum Dershowitz
    Pages 16-26
  4. Gerard Lallement
    Pages 27-38
  5. Hélène Kirchner
    Pages 54-73
  6. Bruno Courcelle
    Pages 74-74
  7. Géraud Sénizergues
    Pages 75-94
  8. Max Dauchet
    Pages 95-113
  9. Michael Bertol, Volker Diekert
    Pages 114-126
  10. Robert H. Gilman
    Pages 127-134
  11. Philippe Balbiani, Luis Fariñas del Cerro
    Pages 196-213
  12. Back Matter

About these proceedings

Introduction

This volume contains thoroughly revised versions of the contributions presented at the French Spring School of Theoretical Computer Science, held in Font Romeu, France in May 1993.
This seminar was devoted to rewriting in a broad sense, as rewriting is now an important discipline, relating to many other areas such as formal languages, models of concurrency, tree automata, functional programming languages, constraints, symbolic computation, and automated deduction. The book includes a number of surveys contributed by senior researchers as well as a few papers presenting original research of relevance for the broader theoretical computer science community.

Keywords

Monoid algorithms automata automated deduction concurrency formal language formal languages

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-59340-3
  • Copyright Information Springer-Verlag 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-59340-9
  • Online ISBN 978-3-540-49237-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book