2000 character limit reached
Measuring closeness between Cayley automatic groups and automatic groups
Published 7 Apr 2018 in math.GR and cs.FL | (1804.02548v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.