Hairdressing in groups: a survey of combings and formal languages

A language theoretic analysis of combings

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 paper gives a systematic analysis of the properties of groups with combings in various formal language classes, and of the closure properties of the associated classes of groups. It generalises previous work, in particular of Epstein et al. and Bridson and Gilman.

字方程、约束与形式语言

Word equations, constraints, and formal languages

本文是一篇简短综述，介绍了群和幺半群中具有非有理约束的字方程的最新进展，并强调了形式语言在该领域的重要作用。