BEING CAYLEY AUTOMATIC IS CLOSED under TAKING WREATH PRODUCT with VIRTUALLY CYCLIC GROUPS
We 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.
