0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Mathematical theory of computation

Buy Now

Confluent String Rewriting (Paperback, Softcover reprint of the original 1st ed. 1988) Loot Price: R1,424
Discovery Miles 14 240
Confluent String Rewriting (Paperback, Softcover reprint of the original 1st ed. 1988): Matthias Jantzen

Confluent String Rewriting (Paperback, Softcover reprint of the original 1st ed. 1988)

Matthias Jantzen

Series: Monographs in Theoretical Computer Science. An EATCS Series, 14

 (sign in to rate)
Loot Price R1,424 Discovery Miles 14 240 | Repayment Terms: R133 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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."

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Monographs in Theoretical Computer Science. An EATCS Series, 14
Release date: October 2011
First published: 1988
Authors: Matthias Jantzen
Dimensions: 235 x 155 x 7mm (L x W x T)
Format: Paperback
Pages: 126
Edition: Softcover reprint of the original 1st ed. 1988
ISBN-13: 978-3-642-64867-0
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
LSN: 3-642-64867-3
Barcode: 9783642648670

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners