Balanced words and dynamical systems

DOI10.1007/s10958-008-9272-3zbMath1177.05009OpenAlexW2090040030MaRDI QIDQ1037173

A. L. Chernyatiev

Publication date: 13 November 2009

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-008-9272-3

zbMATH Keywords

Sturmian wordsbalanced superwordsnonperiodic balanced sequencesnonperiodic balanced words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Dynamical systems involving maps of the circle (37E10) Combinatorial dynamics (types of periodic orbits) (37E15)

Cites Work

• Sturmian words: structure, combinatorics, and their arithmetics
• Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta: n=1,2,\dots \}\)]
• Well-balanced sequences
• Fraenkel's conjecture for six sequences
• Balanced words
• Roots of unity and covering sets
• COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS
• Rédei-matrices and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Balanced words and dynamical systems