J. F. Groote et al:
The mCRL2 tool set.
http://mcrl2.org/mcrl2/wiki/index.php/Home.
Martin Avanzini & Georg Moser (2010):
Closing the Gap Between Runtime Complexity and Polytime Computability.
In: Christopher Lynch: Proceedings of the 21st International Conference on Rewriting Techniques and Applications,
Leibniz International Proceedings in Informatics (LIPIcs) 6.
Schloss Dagstuhl–Leibniz-Zentrum für Informatik,
Dagstuhl, Germany,
pp. 33–48.
V. van Oostrom (2007):
Random Descent.
In: F. Baader: Proceedings of the 18th Conference on Rewriting Techniques and Applications (RTA),
Lecture Notes in Computer Science 4533.
Springer,
pp. 314–328,
doi:10.1007/978-3-540-73449-9_24.
Terese (2003):
Term Rewriting Systems.
Cambridge University Press.
Y. Toyama (2005):
Reduction Strategies for Left-Linear Term Rewriting Systems.
In: A. Middeldorp, V. van Oostrom, F. van Raamsdonk & R. de Vrijer: Processes, Terms and Cycles: Steps on the Road to Infinity:Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday,
Lecture Notes in Computer Science 3838.
Springer,
pp. 198–223,
doi:10.1007/11601548_13.
H. R. Walters & H. Zantema (1995):
Rewrite Systems for Integer Arithmetic.
In: J. Hsiang: Proceedings of the 6th Conference on Rewriting Techniques and Applications,
Lecture Notes in Computer Science 914.
Springer,
pp. 324 – 338,
doi:10.1007/3-540-59200-8_67.
H. Zantema (2003):
Basic arithmetic by rewriting and its complexity.
Available at http://www.win.tue.nl/~hzantema/aritm.pdf.
eptcs@eptcs.org