Items related to Confluent String Rewriting (Monographs in Theoretical...
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series) - Softcover
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.
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date2011
- ISBN 10 3642648673
- ISBN 13 9783642648670
- BindingPaperback
- LanguageEnglish
- Number of pages135
Other Popular Editions of the Same Title
Search results for Confluent String Rewriting (Monographs in Theoretical...
Stock Image
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020233145
Quantity: Over 20 available
Stock Image
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642648670_new
Quantity: Over 20 available
Stock Image
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Published by
Springer-Verlag 1988-01-01, 1988
ISBN 10: 3642648673
ISBN 13: 9783642648670
New
Paperback
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783642648670
Quantity: 10 available
Seller Image
Confluent String Rewriting
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673
ISBN 13: 9783642648670
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642648670
Quantity: 1 available
Seller Image
Confluent String Rewriting
Published by
Springer Berlin Heidelberg Okt 2011, 2011
ISBN 10: 3642648673
ISBN 13: 9783642648670
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 140 pp. Englisch. Seller Inventory # 9783642648670
Quantity: 2 available
Seller Image
Confluent String Rewriting
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673
ISBN 13: 9783642648670
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 5067075
Quantity: Over 20 available
Stock Image
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series, 14)
Seller: dsmbooks, Liverpool, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. Like New. book. Seller Inventory # D8F0-0-M-3642648673-6
Quantity: 1 available