On balanced sequences and their critical exponent
From MaRDI portal
Publication:2098168
DOI10.1016/j.tcs.2022.10.014OpenAlexW3195156705MaRDI QIDQ2098168
Francesco Dolce, L'ubomíra Dvořáková, Edita Pelantová
Publication date: 17 November 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.07503
Related Items
Critical Exponents of Regular Arnoux-Rauzy Sequences ⋮ An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence ⋮ Asymptotic repetitive threshold of balanced sequences
Cites Work
- Unnamed Item
- Aperiodic pseudorandom number generators based on infinite words
- Substitutions in dynamics, arithmetics and combinatorics
- The equation \(a_ M=b^ Nc^ P\) in a free group
- The index of Sturmian sequences
- A characterization of substitutive sequences using return words
- Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta: n=1,2,\dots \}\)]
- Well-balanced sequences
- Special factors, periodicity, and an application to Sturmian words
- Episturmian words and episturmian morphisms
- Balanced words
- Computation of critical exponent in balanced sequences
- On balanced sequences and their asymptotic critical exponent
- Critical exponent of infinite balanced words via the Pell number system
- Return words and bifix codes in eventually dendric sets
- Acyclic, connected and tree sets
- Critical exponents of infinite balanced words
- Sur un théorème de Thue
- On minimal critical exponent of balanced sequences
- Sturmian jungle (or garden?) on multiliteral alphabets
- Complementary symmetric Rote sequences: the critical exponent and the recurrence function
- Eventually dendric shift spaces
- The repetition threshold for binary rich words
- A characterization of Sturmian words by return words
