Term Rewriting
French Spring School of Theoretical Computer Science, Font Romeux, France, 17 - 21, 1993. Advanced Course
Published on 25. April 1995
Book
Paperback/Softback
VIII, 228 pages
978-3-540-59340-9 (ISBN)
Description
This volume contains thoroughly revised versions of the contributions presented at the French Spring School of Theoretical Computer Science, held in Font Romeu, France in May 1993.
This seminar was devoted to rewriting in a broad sense, as rewriting is now an important discipline, relating to many other areas such as formal languages, models of concurrency, tree automata, functional programming languages, constraints, symbolic computation, and automated deduction. The book includes a number of surveys contributed by senior researchers as well as a few papers presenting original research of relevance for the broader theoretical computer science community.
This seminar was devoted to rewriting in a broad sense, as rewriting is now an important discipline, relating to many other areas such as formal languages, models of concurrency, tree automata, functional programming languages, constraints, symbolic computation, and automated deduction. The book includes a number of surveys contributed by senior researchers as well as a few papers presenting original research of relevance for the broader theoretical computer science community.
More details
Series
Edition
1995 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 228 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 13 mm
Weight
365 gr
ISBN-13
978-3-540-59340-9 (9783540593409)
DOI
10.1007/3-540-59340-3
Schweitzer Classification
Content
to rewriting.- 33 Examples of termination.- The word problem for Thue rewriting systems.- Word problem for Thue systems with a few relations.- Some extensions of rewriting.- Graph rewriting: A bibliographical guide.- Formal languages & word-rewriting.- Rewriting and tree automata.- On efficient reduction algorithms for some trace rewriting systems.- Automatic groups and string rewriting.- A survey of symmetrized and complete group presentations.- Normalized rewriting - Application to ground completion and standard bases.- Equational reasoning with 2-dimensional diagrams.- Affine geometry of collinearity and conditional term rewriting.- Burnside monoids word problem and the conjecture of Brzozowski.