Cobham-Semenov theorem and $\NN^d$-subshifts
Fabien Durand (LAMFA)

TL;DR
This paper presents new proofs of the Cobham's first theorem and the Cobham-Semenov theorem in the context of symbolic and tiling dynamics, respectively, offering fresh perspectives on these classical results.
Contribution
It introduces novel proof techniques for the Cobham and Cobham-Semenov theorems using symbolic and tiling dynamics approaches.
Findings
New proof of Cobham's first theorem using symbolic dynamics
New proof of Cobham-Semenov theorem in the primitive case using tiling dynamics
Enhanced understanding of the connection between automata theory and dynamical systems
Abstract
We give a new proof of the Cobham's first theorem using ideas from symbolic dynamics and of the Cobham-Semenov theorem (in the primitive case) using ideas from tiling dynamics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Cellular Automata and Applications
