© 1988

Confluent String Rewriting


Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 14)

Table of contents

  1. Front Matter
    Pages I-IX
  2. Matthias Jantzen
    Pages 1-6
  3. Matthias Jantzen
    Pages 7-26
  4. Matthias Jantzen
    Pages 27-41
  5. Matthias Jantzen
    Pages 49-75
  6. Back Matter
    Pages 113-126

About this book


Replacement systems, such as term rewriting systems, tree manipulat­ ing systems, and graph grammars, have been used in Computer Science in the context of theorem proving, program optimization, abstract data types, algebraic simplification, and symbolic comput­ ation. Replacement systems for strings arose about seventy years earlier in the area of combinatory logic and group theory. The most natural and appropriate formalism for dealing with string rewriting is the notion of a semi-Thue system and this monograph treats its central aspects. The reduction relation is here defined firstly by the direction of the rules and secondly by some metric that yields efficient algorithms. These systems are general enough to discuss the basic notions of arbitrary replacement systems, such as termination, confluence, and the Church-Rosser property in its original meaning. Confluent semi-Thue systems in which each and every derivation consists of finitely many steps only are called complete; they guarantee the existence of unique normal forms as canonical representatives of the Thue congruence classes. Each such system can be considered a nondeterministic algorithm for the word problem which works correctly without backtracking. This is often conceptually simpler and more elegant than an ad hoc construction. In many cases a replace­ ment system can be altered to a complete system by the Knuth-Bendix completion method.


Datenübertragung Monoid Transfomation algorithms complexity Übertragung (EDV)

Authors and affiliations

  1. 1.Fachbereich InformatikUniversität HamburgHamburg 13Germany

Bibliographic information

  • Book Title Confluent String Rewriting
  • Authors Matthias Jantzen
  • Series Title EATCS Monographs on Theoretical Computer Science
  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1988
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Hardcover ISBN 978-3-540-13715-3
  • Softcover ISBN 978-3-642-64867-0
  • eBook ISBN 978-3-642-61549-8
  • Series ISSN 1431-2654
  • Edition Number 1
  • Number of Pages IX, 126
  • Number of Illustrations 0 b/w illustrations, 0 illustrations in colour
  • Topics Mathematical Logic and Formal Languages
  • Buy this book on publisher's site
Industry Sectors
IT & Software