Hairdressing in groups: a survey of combings and formal languages
arXiv:math/9810201
Abstract
A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This article surveys results for combable groups, in particular in the case where the combing is a formal language.
17 pages. Published copy, also available at http://www.maths.warwick.ac.uk/gt/GTMon1/paper24.abs.html