Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents

DOI10.1016/j.ejc.2024.103942arXiv2103.08351MaRDI QIDQ6201925

Jarkko Peltomäki

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.08351

Mathematics Subject Classification ID

Sequences and sets (11Bxx) Discrete mathematics in relation to computer science (68Rxx) Diophantine approximation, transcendental number theory (11Jxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Initial non-repetitive complexity of infinite words
• Introducing privileged words: privileged complexity of Sturmian words
• Substitutions in dynamics, arithmetics and combinatorics
• Eulerian entropy and non-repetitive subword complexity
• Binary words with a given Diophantine exponent
• The index of Sturmian sequences
• Special factors, periodicity, and an application to Sturmian words
• Episturmian words and episturmian morphisms
• A certain power series and the inhomogeneous continued fraction expansions
• On non-repetitive complexity of Arnoux-Rauzy words
• Ostrowski-automatic sequences: theory and applications
• Characterization of repetitions in Sturmian words: a new proof
• Powers in a class of \(\mathcal A\)-strict standard episturmian words
• Quasiperiodic and Lyndon episturmian words
• On the complexity of algebraic numbers. I: Expansions in integer bases
• On the expansion of some exponential periods in an integer base
• EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
• Nombres réels de complexité sous-linéaire : mesures d'irrationalité et de transcendance
• Diophantine properties of real numbers generated by finite automata
• Initial powers of Sturmian sequences
• Représentation géométrique de suites de complexité $2n+1$
• Descriptions of the Characteristic Sequence of an Irrational
• A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
• On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited
• Three Series for the Generalized Golden Mean
• Formal Languages, Automata and Numeration Systems 2
• Episturmian words: a survey
• Dynamics forβ-shifts and Diophantine approximation
• Fractional powers in Sturmian words
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents