Abelian combinatorics on words: a survey
From MaRDI portal
Publication:6101322
DOI10.1016/j.cosrev.2022.100532arXiv2207.09937MaRDI QIDQ6101322
Svetlana Puzynina, Gabriele Fici
Publication date: 20 June 2023
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.09937
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computer science (68-XX)
Related Items
Minimal Complexities for Infinite Words Written with d Letters ⋮ On a Class of 2-Balanced Sequences ⋮ Automaticity and Parikh-Collinear Morphisms ⋮ Characterizations of families of morphisms and words via binomial complexities
Cites Work
- k-Abelian Equivalence and Rationality
- Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable
- Avoiding or Limiting Regularities in Words
- If a DOL language is k-power free then it is circular
- Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$
- Sequence entropy and the maximal pattern complexity of infinite words
- An Introduction to Symbolic Dynamics and Coding
- ABELIAN PRIMITIVE WORDS
- The binomial equivalence classes of finite words
- Abelian Complexity and Synchronization
- Avoidability of Additive Cubes over Alphabets of Four Numbers
- The Logical Approach to Automatic Sequences
- Abelian maximal pattern complexity of words
- Abelian squares are avoidable on 4 letters
- Abelian complexity function of the Tribonacci word
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
- Uniqueness Theorems for Periodic Functions
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
- FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS
- On Context-Free Languages
- Sequences with minimal block growth
- Avoidability of long 𝑘-abelian repetitions
- Templates for the \(k\)-binomial complexity of the Tribonacci word
- A characterization of Sturmian words by return words
- Episturmian words and some constructions of de Luca and Rauzy
- Dyck Words, Lattice Paths, and Abelian Borders
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Abelian powers and repetitions in Sturmian words
- Maximum number of distinct and nonequivalent nonstandard squares in a word
- Introducing privileged words: privileged complexity of Sturmian words
- On a generalization of abelian equivalence and complexity of infinite words
- Fixed points avoiding abelian \(k\)-powers
- Infinite self-shuffling words
- On some generalizations of abelian power avoidability
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Abelian bordered factors and periodicity
- Weak abelian periodicity of infinite words
- An abelian periodicity lemma
- A square root map on Sturmian words
- Recurrent words with constant abelian complexity
- Last cases of Dejean's conjecture
- The number of binary words avoiding Abelian fourth powers grows exponentially
- Substitutions in dynamics, arithmetics and combinatorics
- Problems in between words and abelian words: \(k\)-abelian avoidability
- On cardinalities of \(k\)-abelian equivalence classes
- Periodicity and unbordered segments of words
- A powerful abelian square-free substitution over 4 letters
- Balance and abelian complexity of the Tribonacci word
- Every real number greater than 1 is a critical exponent
- Palindromic richness
- On highly palindromic words
- Everywhere \(\alpha \)-repetitive sequences and Sturmian words
- Avoidable patterns in strings of symbols
- Strongly non-repetitive sequences and progression-free sets
- On certain sequences of lattice points
- How many squares can a string contain?
- Periodicity and the golden ratio
- The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity
- The index of Sturmian sequences
- Transcendence of numbers with a low complexity expansion
- On the number of Abelian square-free words on four letters
- Sturmian words: structure, combinatorics, and their arithmetics
- On nonrepetitive sequences
- Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta: n=1,2,\dots \}\)]
- Balances for fixed points of primitive substitutions.
- Imbalances in Arnoux-Rauzy sequences
- Well-balanced sequences
- Sturmian words and words with a critical exponent
- Special factors, periodicity, and an application to Sturmian words
- On abelian subshifts
- Anti-powers in infinite words
- On \(k\)-abelian palindromes
- Infinite words with linear subword complexity
- The abelian complexity of the paperfolding word
- Abelian powers in paper-folding words
- Words strongly avoiding fractional powers
- Abelian antipowers in infinite words
- Binomial complexities and Parikh-collinear morphisms
- Abelian periods of factors of Sturmian words
- Avoiding abelian powers cyclically
- On highly palindromic words: the \(n\)-ary case
- Abelian closures of infinite binary words
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- Avoiding 2-binomial squares and cubes
- Aperiodic two-dimensional words of small abelian complexity
- Abelian-square-rich words
- Long binary patterns are abelian 2-avoidable
- Counting abelian squares
- On the asymptotic abelian complexity of morphic words
- On the average number of regularities in a word
- A note on abelian returns in rotation words
- Abelian borders in binary words
- Sur un théorème de Thue
- Maximal pattern complexity of words over \(\ell\) letters
- Computing abelian complexity of binary uniform morphic words
- On the number of \(k\)-powers in a finite word
- Avoiding Patterns in the Abelian Sense
- Enumerating Abelian Returns to Prefixes of Sturmian Words
- On abelian versions of critical factorization theorem
- On Abelian repetition threshold
- Formal Languages, Automata and Numeration Systems 1
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Abelian complexity of minimal subshifts
- ON ABELIAN POWER-FREE MORPHISMS
- A proof of Dejean’s conjecture
- Avoiding Three Consecutive Blocks of the Same Size and Same Sum
- On $k$-abelian equivalence and generalized Lagrange spectra
- Combinatorics, Words and Symbolic Dynamics
- Combinatoire de mots récurrents de complexitén+2
- Least Periods of Factors of Infinite Words
- BLOCKING SETS OF TERMS
- Représentation géométrique de suites de complexité $2n+1$
- Repetitions in the Fibonacci infinite word
- Automatic Sequences
