Abstract
AbstractWe extend work of Berdinsky and Khoussainov [‘Cayley automatic representations of wreath products’, International Journal of Foundations of Computer Science27(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.
Publisher
Cambridge University Press (CUP)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lamplighter groups and automata;Acta Informatica;2022-06-08
2. On the geometry of Cayley automatic groups;International Journal of Algebra and Computation;2022-03-15
3. Cayley polynomial–time computable groups;Information and Computation;2021-05