This volume contains revised versions of the contributions presented at the 1993 French Spring School of Theoretical Computer Science. The 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.

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.