The constant of recognizability is computable for primitive morphisms

zbMath1359.68239arXiv1610.05577MaRDI QIDQ2963489

Fabien Durand, Julien Leroy

Publication date: 14 February 2017

Full work available at URL: https://arxiv.org/abs/1610.05577

zbMATH Keywords

combinatorics on wordsrecognizabilitysubstitutioncircularity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

Homomorphisms between multidimensional constant-shape substitutions ⋮ On Substitutions Preserving Their Return Sets ⋮ Automaticity and Parikh-Collinear Morphisms ⋮ Graph towers, laminations and their invariant measures ⋮ Recognizability for sequences of morphisms

This page was built for publication: The constant of recognizability is computable for primitive morphisms