175 years of Springer publishing +++ Through June 30: 50% off Physics & Astronomy Books

Monographs in Theoretical Computer Science. An EATCS Series

Confluent String Rewriting

Authors: Jantzen, Matthias

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-642-61549-8
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $99.00
price for USA
  • ISBN 978-3-540-13715-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $99.00
price for USA
  • ISBN 978-3-642-64867-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

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.

Table of contents (6 chapters)

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-642-61549-8
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $99.00
price for USA
  • ISBN 978-3-540-13715-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $99.00
price for USA
  • ISBN 978-3-642-64867-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Confluent String Rewriting
Authors
Series Title
Monographs in Theoretical Computer Science. An EATCS Series
Series Volume
14
Copyright
1988
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-61549-8
DOI
10.1007/978-3-642-61549-8
Hardcover ISBN
978-3-540-13715-3
Softcover ISBN
978-3-642-64867-0
Series ISSN
1431-2654
Edition Number
1
Number of Pages
IX, 126
Topics