default search action
Term Rewriting 1993
- Hubert Comon, Jean-Pierre Jouannaud:
Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course. Lecture Notes in Computer Science 909, Springer 1995, ISBN 3-540-59340-3 - Jean-Pierre Jouannaud:
Introduction to Rewriting. 1-15 - Nachum Dershowitz:
Examples of Termination. 16-26 - Gerard Lallement:
The Word Problem for Thue Rewriting Systems. 27-38 - Yuri V. Matiyasevich:
Word Problem for Thue Systems with a Few Relations. 39-53 - Hélène Kirchner:
Some Extensions of Rewriting. 54-73 - Bruno Courcelle:
Graph Rewriting: A Bibliographical Guide. 74 - Géraud Sénizergues:
Formal Languages and Word-Rewriting. 75-94 - Max Dauchet:
Rewriting and Tree Automata. 95-113 - Michael Bertol, Volker Diekert:
On Efficient Reduction Algorithms for Some Trace Rewriting Systems. 114-126 - Robert H. Gilman:
Automatic Groups and String Rewriting. 127-134 - Philippe le Chenadec:
A Survey of Symmetrized and Complete Group Presentations. 135-153 - Claude Marché:
Normalized Rewriting - Application to Ground Completion and Standard Bases. 154-169 - Yves Lafont:
Equational Reasoning with Two-Dimensional Diagrams. 170-195 - Philippe Balbiani, Luis Fariñas del Cerro:
Affine Geometry of Collinearity and Conditional Term Rewriting. 196-213 - Jean-François Rey:
Burnside Monoids, Word Problem and the Conjecture of Brzozowski. 214-221
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.