A characterization of substitutive sequences using return words
Combinatorics
2008-07-22 v1
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.
Keywords
Cite
@article{arxiv.0807.3322,
title = {A characterization of substitutive sequences using return words},
author = {Fabien Durand},
journal= {arXiv preprint arXiv:0807.3322},
year = {2008}
}