2000 character limit reached
Substitutive systems and a finitary version of Cobham's theorem (1908.11244v2)
Published 29 Aug 2019 in math.CO, cs.FL, math.DS, and math.NT
Abstract: We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear as common factors of two automatic sequences defined over multiplicatively independent bases. This generalises the famous theorem of Cobham.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.