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

Dmitry BerdinskyMurray ElderJennifer TabackUniversity of Technology SydneyMahidol UniversityMinistry of Higher Education, Science, Research and InnovationBowdoin College2022-08-042022-08-042021-12-13Bulletin of the Australian Mathematical Society. Vol.104, No.3 (2021), 464-47417551633000497272-s2.0-85104488684https://repository.li.mahidol.ac.th/handle/20.500.14594/77373We 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.Mahidol UniversityMathematicsBEING CAYLEY AUTOMATIC IS CLOSED under TAKING WREATH PRODUCT with VIRTUALLY CYCLIC GROUPSArticleSCOPUS10.1017/S000497272100023X