The complexity of generalized Sturmian sequences

DOI10.3836/TJM/1270043226MaRDI QIDQ1922164zbMATH OpenOpenAlexFDO

Authors Shin-ichi Yasutomi

Publication date 12 December 1996

Published in Tokyo Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3836/tjm/1270043226

zbMATH Keywords

algebraic dynamicscomplexitygeneralized Sturmian sequencesinfinite sequence of symbolssubstringssymbolic dynamics

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Measure-theoretic ergodic theory (28D99) Low-dimensional dynamical systems (37E99)

Recommendations

• Complexité de suites engendrées par des récurrences unipotentes
• Complexity of sequences and dynamical systems
• Complexity for finite factors of infinite sequences
• Sequences with subword complexity \(2n\)
• Complexity of sequences with values in a finite set: some examples

Cited in

(7)

• ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS
• Complexity of sequences with values in a finite set: some examples
• Spécialisation de la suite de Sturm
• Minimum complexity of automatic non sturmian sequences
• Complexité de suites engendrées par des récurrences unipotentes
• Return time complexity of Sturmian sequences
• Generalizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithms

This page was built for publication: The complexity of generalized Sturmian sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1922164)