Confluent String Rewriting

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.

Confluent String Rewriting

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.

More Books:

Confluent String Rewriting
Language: en
Pages: 126
Authors: Matthias Jantzen
Categories: Mathematics
Type: BOOK - Published: 2011-10-05 - Publisher: Springer

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
Confluent String Rewriting
Language: en
Pages: 126
Authors: Matthias Jantzen
Categories: Mathematics
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

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
String-Rewriting Systems
Language: en
Pages: 189
Authors: Ronald V. Book, Friedrich Otto
Categories: Computers
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

The subject of this book is string-rewriting systems. It is generally accepted that string-rewriting was first introduced by Axel Thue in the early part of this century. In the 1960's and early 1970's, it received renewed attention due to interest in formal language theory. In the 1980's and 1990's, it
A Survey on Specialized Completion Procedures for Constructing E-confluent String Rewriting Systems
Language: en
Pages: 30
Authors: Friedrich Otto
Categories: Computers
Type: BOOK - Published: 1990 - Publisher:

Books about A Survey on Specialized Completion Procedures for Constructing E-confluent String Rewriting Systems
Some Recent Results on String-rewriting Systems that are Confluent on Some Congruence Class
Language: en
Pages:
Authors: Friedrich Otto
Categories: Computers
Type: BOOK - Published: 1990 - Publisher:

Books about Some Recent Results on String-rewriting Systems that are Confluent on Some Congruence Class