EUR 18,31
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: 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.
EUR 22,64
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: 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.
Anbieter: Ammareal, Morangis, Frankreich
Hardcover. Zustand: Très bon. Ancien livre de bibliothèque. Edition 1988. Tome 14. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1988. Volume 14. Ammareal gives back up to 15% of this item's net price to charity organizations.
Anbieter: Green Ink Booksellers, Hay-on-Wye, POWYS, Vereinigtes Königreich
EUR 37,75
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Very Good. Nice clean bright tight book - no faults 126 pages.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 54,15
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 54,50
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: BargainBookStores, Grand Rapids, MI, USA
EUR 60,33
Währung umrechnenAnzahl: 5 verfügbar
In den WarenkorbHardback or Cased Book. Zustand: New. Confluent String Rewriting 0.83. Book.
Verlag: Springer 1988, 1988
Anbieter: Andere Welten Medienvertriebs GmbH, Ahrensburg, SH, Deutschland
EUR 30,00
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover Sehr gut erhalten.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 60,31
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 61,88
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Springer-Verlag 1988-01-01, 1988
ISBN 10: 3642648673 ISBN 13: 9783642648670
Sprache: Englisch
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 58,42
Währung umrechnenAnzahl: 10 verfügbar
In den WarenkorbPaperback. Zustand: New.
Verlag: Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 53,49
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbTaschenbuch. Zustand: 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.
Verlag: Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Sprache: Englisch
Anbieter: moluna, Greven, Deutschland
EUR 47,23
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Springer, Berlin, Springer Berlin Heidelberg, Springer, 1988
ISBN 10: 3540137157 ISBN 13: 9783540137153
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 77,00
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbBuch. Zustand: 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.
Verlag: Springer Berlin Heidelberg, 1988
ISBN 10: 3540137157 ISBN 13: 9783540137153
Sprache: Englisch
Anbieter: moluna, Greven, Deutschland
EUR 64,08
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 101,07
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Like New. Like New. book.
Anbieter: dsmbooks, Liverpool, Vereinigtes Königreich
EUR 101,48
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. Like New. book.
Verlag: Springer Berlin Heidelberg Okt 2011, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Sprache: Englisch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
EUR 71,64
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbTaschenbuch. Zustand: 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.