arXiv Analytics

Sign in

arXiv:math/9810201 [math.GR]AbstractReferencesReviewsResources

Hairdressing in groups: a survey of combings and formal languages

Sarah Rees

Published 1998-10-29Version 1

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.

Comments: 17 pages. Published copy, also available at http://www.maths.warwick.ac.uk/gt/GTMon1/paper24.abs.html
Journal: Geom. Topol. Monogr. 1 (1998), 493-509
Categories: math.GR
Subjects: 20F10, 20-04, 68Q40, 03D40
Related articles: Most relevant | Search more
arXiv:1905.10460 [math.GR] (Published 2019-05-24)
Recognizing pro-R closures of regular languages
arXiv:1809.02692 [math.GR] (Published 2018-09-07)
Regular Languages for Contracting Geodesics
arXiv:0807.2463 [math.GR] (Published 2008-07-15, updated 2008-09-05)
Automata and cells in affine Weyl groups

Links

Toolbox