This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting systems on strings over a finite alphabet. The emphasis is on Thue systems with the Church-Rosser property, where the notion of reduction is based on length-decreasing rewriting rules. The main effort is expended in outlining the properties of such systems, paying close attention to the issue of the possible decidability of properties and to the issue of the computational complexity of decidable properties. Since Thue systems may also be considered as presentations of monoids, the language of monoids (and groups) is used to describe some of these properties. © 1987, Academic Press Inc. (London) Ltd. All rights reserved.
Book, R. V. (1987). Thue systems as rewriting systems. Journal of Symbolic Computation, 3(1–2), 39–68. https://doi.org/10.1016/S0747-7171(87)80021-4