|
|
|
Item Details
Title:
|
CONFLUENT STRING REWRITING
|
By: |
Matthias Jantzen |
Format: |
Hardback |
List price:
|
£60.99 |
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
ISBN 10: |
3540137157 |
ISBN 13: |
9783540137153 |
Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
Pub. date: |
25 November, 1988 |
Series: |
Monographs in Theoretical Computer Science : An Eatcs Series v.14 |
Pages: |
135 |
Synopsis: |
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. |
Illustrations: |
biography |
Publication: |
Germany |
Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
Returns: |
Returnable |
|
|
|
|
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|