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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.