GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE
DOI10.1142/S0218196708004676zbMath1178.20032arXiv1111.0775OpenAlexW2080781504MaRDI QIDQ3528858
Derek F. Holt, Sarah Rees, Susan M. Hermiller
Publication date: 17 October 2008
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.0775
algorithmsfinitely generated groupsregular languagesautomatic groupsfinite state automatalocally testable languageslanguage of geodesic wordslocally testable groups
Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (2)
Uses Software
Cites Work
- The language of geodesics for Garside groups
- Automatic structures, rational growth, and geometrically finite hyperbolic groups
- A characterisation of virtually free groups.
- Characterizations of locally testable events
- GROWTH SERIES FOR ARTIN GROUPS OF DIHEDRAL TYPE
- A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL
- Algebraic decision procedures for local testability
- COMPUTATION IN WORD-HYPERBOLIC GROUPS
- STAR-FREE GEODESIC LANGUAGES FOR GROUPS
This page was built for publication: GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE