Publication: Measuring Closeness Between Cayley Automatic Groups and Automatic Groups
Issued Date
2018-01-01
Resource Type
ISSN
16113349
03029743
03029743
Other identifier(s)
2-s2.0-85045342054
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.10792 LNCS, (2018), 245-257
Suggested Citation
Dmitry Berdinsky, Phongpitak Trakuldit Measuring Closeness Between Cayley Automatic Groups and Automatic Groups. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.10792 LNCS, (2018), 245-257. doi:10.1007/978-3-319-77313-1_19 Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/45678
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
Measuring Closeness Between Cayley Automatic Groups and Automatic Groups
Author(s)
Other Contributor(s)
Abstract
© Springer International Publishing AG, part of Springer Nature 2018. 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.