On automatic subsets of the Gaussian integers

DOI10.1016/j.indag.2016.11.003zbMath1366.11056arXiv1602.08579OpenAlexW2964343300MaRDI QIDQ505037

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

Publication date: 18 January 2017

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

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

zbMATH Keywords

numeration systemautomatic sequencemultiplicatively independentGaussian integerCobham's theorem

Mathematics Subject Classification ID

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

Related Items (1)

An asymptotic version of Cobham’s theorem

Cites Work

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

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