On a generalization of Dehn's algorithm

Oliver Goodman, Michael Shapiro

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of g…