A generalization of Cobham's theorem
From MaRDI portal
Publication:1386653
DOI10.1007/s002240000084zbMath0895.68081arXiv0807.3406OpenAlexW2093670376MaRDI QIDQ1386653
Publication date: 26 May 1998
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.3406
Related Items (24)
Asymptotic properties of free monoid morphisms ⋮ Dynamical directions in numeration ⋮ Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms ⋮ On multiplicatively dependent linear numeration systems, and periodic points ⋮ A connection between palindromic and factor complexity using return words ⋮ Pronilpotent quotients associated with primitive substitutions ⋮ Hybrid quasicrystals, transport and localization in products of minimal sets ⋮ On Morphisms Preserving Palindromic Richness ⋮ Episturmian words: a survey ⋮ Quantitative estimates for the size of an intersection of sparse automatic sets ⋮ Derived sequences of complementary symmetric Rote sequences ⋮ On Substitutions Preserving Their Return Sets ⋮ An asymptotic version of Cobham’s theorem ⋮ Conjugacy of unimodular Pisot substitution subshifts to domain exchanges ⋮ New techniques for classifying Williams solenoids ⋮ Rigidity in one-dimensional tiling spaces ⋮ Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts ⋮ Some remarks about stabilizers ⋮ Cobham’s theorem and its extensions ⋮ An extension of the Cobham-Semënov Theorem ⋮ Self-similar tiling systems, topological factors and stretching factors ⋮ On recognizable sets of integers ⋮ Singular substitutions of constant length ⋮ Invertible substitutions and local isomorphisms
This page was built for publication: A generalization of Cobham's theorem
