Matrix analysis
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
A characterization of substitutive sequences using return words
Discrete Mathematics
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Hi-index | 5.25 |
We give a new proof of Cobham's first theorem using ideas from symbolic dynamics and of Cobham-Semenov theorem (in the primitive case) using ideas from tiling dynamics.