Publication: Measuring Closeness Between Cayley Automatic Groups and Automatic Groups
| dc.contributor.author | Dmitry Berdinsky | en_US |
| dc.contributor.author | Phongpitak Trakuldit | en_US |
| dc.contributor.other | Mahidol University | en_US |
| dc.contributor.other | Commission on Higher Education | en_US |
| dc.date.accessioned | 2019-08-23T10:58:57Z | |
| dc.date.available | 2019-08-23T10:58:57Z | |
| dc.date.issued | 2018-01-01 | en_US |
| dc.description.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. | en_US |
| dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.10792 LNCS, (2018), 245-257 | en_US |
| dc.identifier.doi | 10.1007/978-3-319-77313-1_19 | en_US |
| dc.identifier.issn | 16113349 | en_US |
| dc.identifier.issn | 03029743 | en_US |
| dc.identifier.other | 2-s2.0-85045342054 | en_US |
| dc.identifier.uri | https://repository.li.mahidol.ac.th/handle/20.500.14594/45678 | |
| dc.rights | Mahidol University | en_US |
| dc.rights.holder | SCOPUS | en_US |
| dc.source.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85045342054&origin=inward | en_US |
| dc.subject | Computer Science | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Measuring Closeness Between Cayley Automatic Groups and Automatic Groups | en_US |
| dc.type | Conference Paper | en_US |
| dspace.entity.type | Publication | |
| mu.datasource.scopus | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85045342054&origin=inward | en_US |