A rewriting system comprises an alphabet and some rules for simplifying words over the alphabet. Each rewriting system ``presents'' a monoid, and sometimes that monoid is a group. It is natural ask which groups admit a presentation by particularly nice rewriting systems. In this talk we discuss a conjecture made by Gilman in 1984 that plain groups are exactly the groups which can be presented by finite convergent monadic rewriting systems.