Abstract: We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.
Recommendations
Cites work
- Automatic Sequences
- scientific article; zbMATH DE number 5605083 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Logic and p-recognizable sets of integers
- Multidimensional extension of the Morse-Hedlund theorem
- On the base-dependence of sets of numbers recognizable by finite automata
- Presburgerness of predicates regular in two number systems
- Towards a theorem of Cobham for Gaussian integers
Cited in
(12)- 2- and 3-Mahler recurrences
- On the boundary sequence of an automatic sequence
- On Cobham's theorem
- Une généralisation du théorème de Cobham
- scientific article; zbMATH DE number 1984012 (Why is no real title available?)
- Cobham's Theorem seen through Büchi's Theorem
- Cobham's theorem and its extensions
- Cobham’s Theorem and Automaticity
- Quantitative estimates for the size of an intersection of sparse automatic sets
- An asymptotic version of Cobham’s theorem
- Obstacles to topological factoring of Toeplitz shifts
- Cobham's theorem for the Gaussian integers
This page was built for publication: A more reasonable proof of Cobham's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859683)
