Results of Anick (1986), Squier (1987), Kobayashi (1990), Brown (1992b), and others, show that a monoid with a finite convergent rewriting system satisfies a homological condition known as FP∞.In this paper we give a simplified version of Brown's proof, which is conceptual, in contrast with the other proofs, which are computational.We also collect together a large number of results and examples of monoids and groups that satisfy FP ∞ and others that do not. These may provide techniques for showing that various monoids do not have finite convergent rewriting systems, as well as explicit examples with which methods can be tested.
['Daniel Cohen']
String rewriting and homology of monoids