Publication:
BEING CAYLEY AUTOMATIC IS CLOSED under TAKING WREATH PRODUCT with VIRTUALLY CYCLIC GROUPS

dc.contributor.authorDmitry Berdinskyen_US
dc.contributor.authorMurray Elderen_US
dc.contributor.authorJennifer Tabacken_US
dc.contributor.otherUniversity of Technology Sydneyen_US
dc.contributor.otherMahidol Universityen_US
dc.contributor.otherMinistry of Higher Education, Science, Research and Innovationen_US
dc.contributor.otherBowdoin Collegeen_US
dc.date.accessioned2022-08-04T08:56:27Z
dc.date.available2022-08-04T08:56:27Z
dc.date.issued2021-12-13en_US
dc.description.abstractWe extend work of Berdinsky and Khoussainov ['Cayley automatic representations of wreath products', International Journal of Foundations of Computer Science 27(2) (2016), 147-159] to show that being Cayley automatic is closed under taking the restricted wreath product with a virtually infinite cyclic group. This adds to the list of known examples of Cayley automatic groups.en_US
dc.identifier.citationBulletin of the Australian Mathematical Society. Vol.104, No.3 (2021), 464-474en_US
dc.identifier.doi10.1017/S000497272100023Xen_US
dc.identifier.issn17551633en_US
dc.identifier.issn00049727en_US
dc.identifier.other2-s2.0-85104488684en_US
dc.identifier.urihttps://repository.li.mahidol.ac.th/handle/20.500.14594/77373
dc.rightsMahidol Universityen_US
dc.rights.holderSCOPUSen_US
dc.source.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85104488684&origin=inwarden_US
dc.subjectMathematicsen_US
dc.titleBEING CAYLEY AUTOMATIC IS CLOSED under TAKING WREATH PRODUCT with VIRTUALLY CYCLIC GROUPSen_US
dc.typeArticleen_US
dspace.entity.typePublication
mu.datasource.scopushttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85104488684&origin=inwarden_US

Files

Collections