String-rewriting systems
Author(s)
Bibliographic Information
String-rewriting systems
（Texts and monographs in computer science）
Springer-Verlag, c1993
- : us
- : gw
Available at / 28 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
- Volume
-
: us ISBN 9780387979656
Description
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 has received more interest since it can be viewed as a special case of term rewriting, a subject that has become important in the study of automated deduction. Today, string-rewriting is studied by researchers in theoretical computer science and also by researchers interested in the foundations of artificial intelligence. A sketch of the way that the subject has developed is contained in Chapter 0, and the reader is advised to begin with that chapter. Both authors have been active in the field and have lectured on the subject in several universities. Lecture notes have been produced and dis tributed. This monograph is a result of revising and rewriting those notes. It represents an attempt by the authors to present the concepts that the authors consider to be most fundamental and to gather together the most useful results in such a way that they can be understood and used in studies relating to more general rewriting, to automated deduction, and to algo rithmic problems of algebraic structures. This monograph is written for independent study by researchers in the oretical computer science or in the foundations of artificial intelligence."
- Volume
-
: gw ISBN 9783540979654
Description
The book represents an attempt by the authors to gather together the most fundamental results on string-rewriting systems. The goal is to explain these results in such a way that they can be understood and used in studies relating to more general rewriting, automated deduction, and algorithmic problems of algebraic structures. The authors have concentrated on presenting basic material that ought to be a prerequisite for understanding more specialized material. The monograph opens with the preliminaries of string-rewriting systems followed by length as the basis for reduction. Monadic string-rewriting systems is covered as well as length-reducing non-monadic string-writing systems. The book closes with the subjects of algebraic protocols and algebraic properties. When the reader has mastered the material in the core of the book (Chapters 1-4), then that person should be equipped to explore the ever-growing body of literature in the field of string-rewriting systems. Both authors have been active in the field of string-rewriting systems and have lectured on the subject in several universities. Lecture notes have been produced and distributed.
This monograph is a result of revising and rewriting those notes. This monograph is written for independent study by researchers in theoretical computer science or in the foundation of artificial intelligence. This book is not intended as a textbook, but it certainly could be used as a textbook in computer science. It could be used for a course entitled "Rewriting Systems", or "String Rewriting", or "Foundations of Artificial Intelligence".
by "Nielsen BookData"
