On automatic subsets of the Gaussian integers

DOI10.1016/J.INDAG.2016.11.003zbMATH Open1366.11056arXiv1602.08579OpenAlexW2964343300MaRDI QIDQ505037FDOQ505037

Authors: Wieb Bosma, Robbert Fokkink, Thijmen J. P. Krebs 

Publication date: 18 January 2017

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Abstract: Suppose that $a$ and $b$ are multiplicatively independent Gaussian integers, that are both of modulus~$geqsqrt5$. We prove that there exist a $XsubsetmathbbZ[i]$ which is $a$-automatic but not $b$-automatic. This settles a problem of Allouche, Cateland, Gilbert, Peitgen, Shallit, and Skordev.

Full work available at URL: https://arxiv.org/abs/1602.08579

Recommendations

• \(k\)-automatic sets of rational numbers
• Automatic sets of rational numbers
• Automatic maps in exotic numeration systems
• AUTOMATIC MAPS ON A SEMIRING WITH DIGITS
• When is an automatic set an additive basis?

zbMATH Keywords

automatic sequencenumeration systemmultiplicatively independentGaussian integerCobham's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Automata sequences (11B85)

Cites Work

• Automatic Sequences
• On the base-dependence of sets of numbers recognizable by finite automata
• Cobham's theorem for substitutions
• Weak Second‐Order Arithmetic and Finite Automata
• An analogue of Cobham's theorem for graph directed iterated function systems
• Towards a theorem of Cobham for Gaussian integers
• Title not available (Why is that?)
• Automatic maps in exotic numeration systems

Cited In (5)

• Title not available (Why is that?)
• Automatic sets of rational numbers
• On the disjointness problem for Gaussian automorphisms
• An asymptotic version of Cobham’s theorem
• \(k\)-automatic sets of rational numbers

This page was built for publication: On automatic subsets of the Gaussian integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505037)