Confluent String Rewriting

Print on Demand | 1027 Stück | Lieferzeit:3-5 Tage I

71,64 €*

Alle Preise inkl. MwSt. | zzgl. Versand
Matthias Jantzen
223 g
235x155x7 mm

1. Basic Definitions.- 1.1 General Reduction Systems.- 1.2 String Rewriting.- 2. Decision Problems.- 2.1 Undecidability Results.- 2.2 Decidability Results.- 3. Congruential Languages Specified by Semi-Thue Systems.- 4. Complete STSs, Groups, and Monoids.- 4.1 Introduction and General Results.- 4.2 The STS S1 = {(abba, ?)}.- 5. The Special One-Relator STSs Snfor n 1 and the Groups Gn.- 5.1 Definitions, Notation, and Characterization of Gnas a Semidirect Product.- 5.2 Matrix Representation of Gn in GL2(?).- 5.3 Normal Forms, Conjugates, and Homomorphisms.- 5.4 Commutativity and Unique Divisibility in Gn.- 5.5 Complete Presentation for Gn.- 5.6 Sn Has No Preperfect Equivalent.- 5.7 Irreducible Strings in STSs Equivalent to Sn.- References and Further Reading.
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.