Librería: Attic Books (ABAC, ILAB), London, ON, Canada
EUR 17,60
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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.
Publicado por Springer 1988, 1988
Librería: Andere Welten Medienvertriebs GmbH, Ahrensburg, SH, Alemania
EUR 30,00
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover Sehr gut erhalten.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 57,10
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 60,61
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Publicado por Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 47,23
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
EUR 58,29
Convertir monedaCantidad disponible: 5 disponibles
Añadir al carritoHardback or Cased Book. Condición: New. Confluent String Rewriting 0.83. Book.
EUR 53,57
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 56,51
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
EUR 60,60
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 74,41
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 140.
EUR 74,51
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 140.
Publicado por Springer Berlin Heidelberg, 1988
ISBN 10: 3540137157 ISBN 13: 9783540137153
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 64,08
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,05
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,39
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 108,53
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 99,00
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
EUR 129,45
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Publicado por Springer Berlin Heidelberg Okt 2011, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 71,64
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 75,51
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: 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.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 77,10
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: 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.
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2011, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 78,40
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 140.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 80,01
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 140.