A characterization of substitutive sequences using return words
classification
🧮 math.CO
keywords
sequencessubstitutivecharacterizationdefinedderivedfinitehereonly
read the original abstract
We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.