Articles liés à Confluent String Rewriting
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer
- Date d'édition2011
- ISBN 10 3642648673
- ISBN 13 9783642648670
- ReliureBroché
- Langueanglais
- Nombre de pages140
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 48,74
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Confluent String Rewriting
Image fournie par le vendeur
Confluent String Rewriting
Edité par
Springer Berlin Heidelberg, 2011
ISBN 10 : 3642648673
ISBN 13 : 9783642648670
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 5067075
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Confluent String Rewriting
Edité par
Springer Berlin Heidelberg, 2011
ISBN 10 : 3642648673
ISBN 13 : 9783642648670
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783642648670
Quantité disponible : 1 disponible(s)
Image d'archives
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783642648670_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Edité par
Springer-Verlag 1988-01-01, 1988
ISBN 10 : 3642648673
ISBN 13 : 9783642648670
Neuf
Paperback
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783642648670
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Confluent String Rewriting
Edité par
Springer Berlin Heidelberg Okt 2011, 2011
ISBN 10 : 3642648673
ISBN 13 : 9783642648670
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783642648670
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Confluent String Rewriting
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2011, 2011
ISBN 10 : 3642648673
ISBN 13 : 9783642648670
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 140 pp. Englisch. N° de réf. du vendeur 9783642648670
Quantité disponible : 2 disponible(s)
Image d'archives
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020233145
Quantité disponible : Plus de 20 disponibles
Image d'archives
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series, 14)
Edité par
Springer, 2011
ISBN 10 : 3642648673
ISBN 13 : 9783642648670
Ancien ou d'occasion
Paperback
Vendeur : dsmbooks, Liverpool, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur D8F0-0-M-3642648673-6
Quantité disponible : 1 disponible(s)