Matthias Jantzen
Confluent String Rewriting
- Springer Berlin Heidelberg
- 2011
- Taschenbuch
- 140 Seiten
- ISBN 9783642648670
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
Mehr
Weniger
zzgl. Versand
in Kürze