A density version of Cobham’s theorem

DOI10.4064/aa180626-13-1zbMath1477.11049arXiv1710.07261OpenAlexW2989326071WikidataQ126839899 ScholiaQ126839899MaRDI QIDQ5220090

Jakub Byszewski, Jakub Konieczny

Publication date: 10 March 2020

Published in: Acta Arithmetica (Search for Journal in Brave)

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

zbMATH Keywords

automatic sequencesfactorialCobham's theorem

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Symbolic dynamics (37B10) Automata sequences (11B85)

Related Items (5)

How to prove that a sequence is not automatic ⋮ On \(k\)-regularity of sequences of valuations and last non-zero digits ⋮ An asymptotic version of Cobham’s theorem ⋮ Automaticity of the sequence of the last nonzero digits of \(n!\) in a fixed base ⋮ Substitutive systems and a finitary version of Cobham's theorem

This page was built for publication: A density version of Cobham’s theorem