COMBING NILPOTENT AND POLYCYCLIC GROUPS
From MaRDI portal
Publication:4513294
DOI10.1142/S0218196799000102zbMath1028.20032arXivmath/9901088MaRDI QIDQ4513294
Derek F. Holt, Sarah Rees, Robert H. Gilman
Publication date: 7 November 2000
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9901088
nilpotent groups; polycyclic groups; length functions; automatic groups; Dehn functions; combings; real-time languages
68Q45: Formal languages and automata
20F16: Solvable groups, supersolvable groups
20F65: Geometric group theory
20F18: Nilpotent groups
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Cites Work
- A shrinking lemma for indexed languages
- Rational subgroups of biautomatic groups
- On derivation trees of indexed grammars - an extension of the uvwxy- theorem
- Combings of semidirect products and 3-manifold groups
- Isoperimetric inequalities and the homology of groups
- Formal language theory and the geometry of 3-manifolds
- Real time computation
- On the Geometry of Normal Forms in Discrete Groups
- Real-Time Definable Languages
- Indexed Grammars—An Extension of Context-Free Grammars
- Nested Stack Automata