
 Introduction (Site not responding. Last check: 20071106) 
  A rewrite monoid M is a finitely presented monoid in which equality between elements of M, called words or strings, is decidable via a sequence of rewriting equations, called reduction relations, rules, or equations. 
  If a rewrite monoid M is confluent its reduction relations, or more specifically its reduction machine, can be used to reduce words in M to their irreducible normal forms under the given ordering, and so the word problem for M can be efficiently solved. 
  The objects are the rewrite monoids and the morphisms are monoid homomorphisms. 
 www.math.niu.edu /help/math/magmahelp/text224.html (315 words) 
