English

On automatic subsets of the Gaussian integers

Formal Languages and Automata Theory 2016-08-26 v3

Abstract

Suppose that aa and bb are multiplicatively independent Gaussian integers, that are both of modulus~5\geq \sqrt 5. We prove that there exist a XZ[i]X\subset \mathbb Z[i] which is aa-automatic but not bb-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}
}
R2 v1 2026-06-22T12:59:07.146Z