Hairdressing in groups: a survey of combings and formal languages
classification
🧮 math.GR
keywords
languagecombablecombingformalgroupgroupsarticleautomatic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.