Abelian Repetitions in Sturmian Words
From MaRDI portal
Publication:5300843
DOI10.1007/978-3-642-38771-5_21zbMath1381.68233arXiv1209.6013OpenAlexW2150516939MaRDI QIDQ5300843
Alessio Langiu, Thierry Lecroq, Élise Prieur-Gaston, Arnaud Lefebvre, Filippo Mignosi, Gabriele Fici
Publication date: 28 June 2013
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.6013
Related Items
Abelian-square-rich words ⋮ Abelian powers and repetitions in Sturmian words ⋮ Words with the Maximum Number of Abelian Squares ⋮ Algorithms for computing abelian periods of words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on Sturmian words
- Algorithms for computing abelian periods of words
- Substitutions in dynamics, arithmetics and combinatorics
- Characteristic Sturmian words are extremal for the critical factorization theorem
- On the number of factors of Sturmian words
- Repetitions in strings: algorithms and combinatorics
- A characterization of the squares in a Fibonacci string
- Infinite words with linear subword complexity
- Characterisations of balanced words via orderings
- A note on efficient computation of all abelian periods in a string
- Characterizations of finite and infinite episturmian words via lexicographic orderings
- Some characterizations of Sturmian words in terms of the lexicographic order
- On abelian versions of critical factorization theorem
- On Abelian repetition threshold
- Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Abelian complexity of minimal subshifts
- Sturmian and Episturmian Words
- Combinatorics on Words
- Repetitions in the Fibonacci infinite word
- ABELIAN PRIMITIVE WORDS
- IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS
- On Context-Free Languages
- Abelian returns in Sturmian words
