Order Total (1 Item Items):
Shipping Destination:
Confluent String Rewriting (28 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (28)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (23)
- As New, Fine or Near Fine (2)
- Very Good or Good (3)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (13)
- Not Print on Demand (22)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Confluent String Rewriting
Seller: Attic Books (ABAC, ILAB), London, ON, Canada
Seller rating 5 out of 5 stars
Hardcover. Condition: Very good +. EATCS Monographs on Theoretical Computer Science. viii, 126 p. 25 cm. Dents in bottom of front board. Ink signature in bottom of front board.
-
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:3540137157.
-
Confluent String Rewriting ( Eatcs Monographs on Theoretical Computer Science)
Seller: Green Ink Booksellers, Hay-on-Wye, POWYS, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. Nice clean bright tight book - no faults 126 pages.
-
-
Condition: New.
-
-
Condition: New. SUPER FAST SHIPPING.
-
Condition: New. SUPER FAST SHIPPING.
-
Condition: As New. Unread book in perfect condition.
-
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
US$ 64.95
US$ 15.78 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series, 14)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 66.65
US$ 15.78 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
PF. Condition: New.
-
Confluent String Rewriting
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 66.64
US$ 19.76 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. pp. 140.
-
Condition: New. pp. 140.
-
Confluent String Rewriting
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 75.65
US$ 19.76 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Hardback or Cased Book. Condition: New. Confluent String Rewriting. Book.
-
Confluent String Rewriting
Published by Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Language: English
Condition: New.
-
Confluent String Rewriting
Published by Springer Berlin Heidelberg, 1988
ISBN 10: 3540137157 ISBN 13: 9783540137153
Language: English
Condition: New.
-
Confluent String Rewriting
Published by Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Language: English
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.
-
Taschenbuch. Condition: Neu. Confluent String Rewriting | Matthias Jantzen | Taschenbuch | ix | Englisch | 2011 | Springer | EAN 9783642648670 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Confluent String Rewriting
Published by Springer, Berlin, Springer Berlin Heidelberg, Springer, 1988
ISBN 10: 3540137157 ISBN 13: 9783540137153
Language: English
Buch. Condition: Neu. 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.
-
Condition: New. Print on Demand pp. 140 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Condition: New. Print on Demand pp. 140 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
-
Condition: New. PRINT ON DEMAND pp. 140.
-
Condition: New. PRINT ON DEMAND pp. 140.
-
Confluent String Rewriting
Published by Springer Berlin Heidelberg Okt 2011, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Language: English
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.
-
Confluent String Rewriting
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2011, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 140 pp. Englisch.
