On automatic subsets of the Gaussian integers
Abstract
Suppose that a and b are multiplicatively independent Gaussian integers, that are both of modulus~≥ 5. We prove that there exist a X⊂ Z[i] which is a-automatic but not b-automatic. This settles a problem of Allouche, Cateland, Gilbert, Peitgen, Shallit, and Skordev.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.