Artículos relacionados a Confluent String Rewriting: 14 (Monographs in Theoretical...
Confluent String Rewriting: 14 (Monographs in Theoretical Computer Science. An EATCS Series) - Tapa blanda
Sinopsis
Book by Jantzen Matthias
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
Reseña del editor
This monograph treats comprehensively central aspects of string rewriting systems in the form of semi-Thue systems. These are so general as to enable the discussion of all the basic notions and questions that arise in arbitrary replacement systems as used in various areas of computer science. The Church-Rosser property is used in its original meaning and the existence of complete monoid and group presentations is the central point of discussion. Decidability problems with their complexity are surveyed and congruential languages including the deterministic context-free NTS languages are discussed. The book contains a number of generalizations of results published elsewhere, e.g., the uniqueness of complete string rewriting systems with respect to the underlying order. Completely new and unpublished results which serve as an exposition of techniques and new methods are discussed in detail. With the help of semi-Thue systems it is shown in which situations the famous Knuth-Bendix completion method does not terminate and why, and that in general complete replacement systems cannot always be used as algorithms to solve the word problem. It is suggested how these situations can be stated by using a certain control under which the rewriting is to be performed. This monograph is a reference for graduate students and active researchers in theoretical computer science. The reader is led to the forefront of current research in the area of string rewriting and monoid presentations.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación2011
- ISBN 10 3642648673
- ISBN 13 9783642648670
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas140
EUR 101,72
EUR 29,48 gastos de envío desde Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 54,27
EUR 3,55 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Confluent String Rewriting: 14 (Monographs in Theoretical...
Imagen de archivo
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020233145
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783642648670_new
Gastos de envío:
EUR 14,13
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Publicado por
Springer-Verlag 1988-01-01, 1988
ISBN 10: 3642648673
ISBN 13: 9783642648670
Nuevo
Paperback
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783642648670
Gastos de envío:
EUR 18,27
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 10 disponibles
Imagen del vendedor
Confluent String Rewriting
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673
ISBN 13: 9783642648670
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. 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. Nº de ref. del artículo: 9783642648670
Gastos de envío:
EUR 29,11
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen del vendedor
Confluent String Rewriting
Publicado por
Springer Berlin Heidelberg Okt 2011, 2011
ISBN 10: 3642648673
ISBN 13: 9783642648670
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. 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. Nº de ref. del artículo: 9783642648670
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen del vendedor
Confluent String Rewriting
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673
ISBN 13: 9783642648670
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 5067075
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series, 14)
Librería: dsmbooks, Liverpool, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Like New. Like New. book. Nº de ref. del artículo: D8F0-0-M-3642648673-6
Gastos de envío:
EUR 29,48
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles