A More Reasonable Proof of Cobham’s Theorem

DOI10.1142/S0129054121500118zbMath1484.11092arXiv1801.06704OpenAlexW3127768611MaRDI QIDQ5859683

Thijmen J. P. Krebs

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

automatic sequenceCobham's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (3)

Quantitative estimates for the size of an intersection of sparse automatic sets ⋮ On the boundary sequence of an automatic sequence ⋮ Cobham’s Theorem and Automaticity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional extension of the Morse-Hedlund theorem
• Presburgerness of predicates regular in two number systems
• Logic and \(p\)-recognizable sets of integers
• Towards a theorem of Cobham for Gaussian integers
• Automatic Sequences
• On the base-dependence of sets of numbers recognizable by finite automata

This page was built for publication: A More Reasonable Proof of Cobham’s Theorem