Skip to main content
SpringerLink
Log in

Term Rewriting

French Spring School of Theoretical Computer Science, Font Romeux, France, 17 - 21, 1993. Advanced Course

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Hubert Comon
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jean-Pierre Jounnaud
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: TCS School 1993.

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

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 papers)

  1. Front Matter

    Download chapter PDF

  2. Introduction to rewriting

    • Jean-Pierre Jouannaud
    Pages 1-15

  3. 33 Examples of termination

    • Nachum Dershowitz
    Pages 16-26

  4. The word problem for Thue rewriting systems

    • Gerard Lallement
    Pages 27-38

  5. Word problem for Thue systems with a few relations

    • Yuri Matiyasevich
    Pages 39-53

  6. Some extensions of rewriting

    • Hélène Kirchner
    Pages 54-73

  7. Graph rewriting: A bibliographical guide

    • Bruno Courcelle
    Pages 74-74

  8. Formal languages & word-rewriting

    • Géraud Sénizergues
    Pages 75-94

  9. Rewriting and tree automata

    • Max Dauchet
    Pages 95-113

  10. On efficient reduction algorithms for some trace rewriting systems

    • Michael Bertol, Volker Diekert
    Pages 114-126

  11. Automatic groups and string rewriting

    • Robert H. Gilman
    Pages 127-134

  12. A survey of symmetrized and complete group presentations

    • Philippe Le Chenadec
    Pages 135-153

  13. Normalized rewriting — Application to ground completion and standard bases

    • Claude Marché
    Pages 154-169

  14. Equational reasoning with 2-dimensional diagrams

    • Yves Lafont
    Pages 170-195

  15. Affine geometry of collinearity and conditional term rewriting

    • Philippe Balbiani, Luis Fariñas del Cerro
    Pages 196-213

  16. Burnside monoids word problem and the conjecture of Brzozowski

    • Jean-François Rey
    Pages 214-221

  17. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Term Rewriting

Keywords

About this book

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.

Bibliographic Information

  • Book Title: Term Rewriting

  • Book Subtitle: French Spring School of Theoretical Computer Science, Font Romeux, France, 17 - 21, 1993. Advanced Course

  • Editors: Hubert Comon, Jean-Pierre Jounnaud

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-59340-3

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1995

  • Softcover ISBN: 978-3-540-59340-9Published: 25 April 1995

  • eBook ISBN: 978-3-540-49237-5Published: 05 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 228

  • Topics: Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Back to top

Search

Navigation