Thue systems as rewriting systems (Q1099642)

The paper is a survey of recent results on Thue systems that have been obtained in the last ten years. The emphasis is on Thue systems with the Church-Rosser property and the main effort is expended in outlining the properties of such systems and the monoids they present. Of special concern are the results that describe the inherent computational complexity of problems that arise in this area. The language of monoids (and groups) is used to describe some of these properties. This survey would be of interest for computer scientists as well as for logicians interested in computability theory.