Term Rewriting 1993

@proceedings{DBLP:conf/ac/1993tr,
  editor    = {Hubert Comon and
               Jean-Pierre Jouannaud},
  title     = {Term Rewriting, French Spring School of Theoretical Computer
               Science, Font Romeux, France, May 17-21, 1993, Advanced Course},
  booktitle = {Term Rewriting},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {909},
  year      = {1995},
  isbn      = {3-540-59340-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Jean-Pierre Jouannaud: Introduction to Rewriting. 1-15 BibTeX
• Nachum Dershowitz: Examples of Termination. 16-26 BibTeX
• Gerard Lallement: The Word Problem for Thue Rewriting Systems. 27-38 BibTeX
• Yuri Matiyasevich: Word Problem for Thue Systems with a Few Relations. 39-53 BibTeX
• Hélène Kirchner: Some Extensions of Rewriting. 54-73 BibTeX
• Bruno Courcelle: Graph Rewriting: A Bibliographical Guide. 74 BibTeX
• Géraud Sénizergues: Formal Languages and Word-Rewriting. 75-94 BibTeX
• Max Dauchet: Rewriting and Tree Automata. 95-113 BibTeX
• Michael Bertol, Volker Diekert: On Efficient Reduction Algorithms for Some Trace Rewriting Systems. 114-126 BibTeX
• Robert H. Gilman: Automatic Groups and String Rewriting. 127-134 BibTeX
• Philippe le Chenadec: A Survey of Symmetrized and Complete Group Presentations. 135-153 BibTeX
• Claude Marché: Normalized Rewriting - Application to Ground Completion and Standard Bases. 154-169 BibTeX
• Yves Lafont: Equational Reasoning with Two-Dimensional Diagrams. 170-195 BibTeX
• Philippe Balbiani, Luis Fariñas del Cerro: Affine Geometry of Collinearity and Conditional Term Rewriting. 196-213 BibTeX
• Jean-François Rey: Burnside Monoids, Word Problem and the Conjecture of Brzozowski. 214-221 BibTeX