About these proceedings
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.
Monoid algorithms automata automated deduction concurrency formal language formal languages
Springer-Verlag Berlin Heidelberg 1995
Springer, Berlin, Heidelberg
Springer Book Archive
Series Print ISSN
Series Online ISSN
Buy this book on publisher's site