Cut-and-project sequences and substitution rules

Abstract

We consider infinite words in a 3-letter alphabet which arise from the cut-and-project scheme based on quadratic unitary Pisot numbers. Such sequences may be considered as ternary generalizations of classical Sturmian sequences. We describe the complexity of such sequences and give a condition under which these generalized Sturmian sequences are invariant under a substitution rule.