Measuring closeness between Cayley automatic groups and automatic groups
Preprint
Abstract
In this paper we introduce a way to estimate a level of closeness of Cayley automatic groups to the class of automatic groups using a certain numerical characteristic. We characterize Cayley automatic groups which are not automatic in terms of this numerical characteristic and then study it for the lamplighter group, the Baumslag--Solitar groups and the Heisenberg group.Keywords
All Related Versions
- Version 1, 2018-04-07, ArXiv
- Version 2, 2021-08-17, ArXiv
- Published version: , 245.
This publication has 9 references indexed in Scilit:
- Higher rank lamplighter groups are graph automaticJournal of Algebra, 2018
- Cayley Automatic Representations of Wreath ProductsInternational Journal of Foundations of Computer Science, 2016
- Metric properties of Baumslag–Solitar groupsInternational Journal of Algebra and Computation, 2015
- Dead end words in lamplighter groups and other wreath productsThe Quarterly Journal of Mathematics, 2005
- Automatic structures: richness and limitations2004
- Word distance on the discrete Heisenberg groupColloquium Mathematicum, 2003
- Numerical Characteristics of Groups and Corresponding RelationsJournal of Mathematical Sciences, 2001
- Combinatorial Group Theory2001
- Some two-generator one-relator non-Hopfian groupsBulletin of the American Mathematical Society, 1962