On automatic subsets of the Gaussian integers
Formal Languages and Automata Theory
2016-08-26 v3
Abstract
Suppose that and are multiplicatively independent Gaussian integers, that are both of modulus~. We prove that there exist a which is -automatic but not -automatic. This settles a problem of Allouche, Cateland, Gilbert, Peitgen, Shallit, and Skordev.
Cite
@article{arxiv.1602.08579,
title = {On automatic subsets of the Gaussian integers},
author = {Wieb Bosma and Robbert Fokkink and Thijmen Krebs},
journal= {arXiv preprint arXiv:1602.08579},
year = {2016}
}