Abelian-square-rich words
From MaRDI portal
Publication:2358695
DOI10.1016/j.tcs.2017.02.012zbMath1395.68224arXiv1701.00948MaRDI QIDQ2358695
Filippo Mignosi, Gabriele Fici, Jeffrey O. Shallit
Publication date: 15 June 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.00948
68R15: Combinatorics on words
Uses Software
Cites Work
- 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
- How many double squares can a string contain?
- Cyclic complexity of words
- Correction to: Linear fractional transformations of continued fractions with bounded partial quotients
- The ring of \(k\)-regular sequences
- How many squares can a string contain?
- Limit values of the recurrence quotient of Sturmian sequences
- Palindrome complexity bounds for primitive substitution sequences
- Infinite words with linear subword complexity
- Enumeration of factors in the Thue-Morse word
- Periodicity, repetitions, and orbits of an automatic sequence
- A note on the number of squares in a word
- On the average number of regularities in a word
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
- Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
- Words with the Maximum Number of Abelian Squares
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Repetitions in the Fibonacci infinite word
- Automatic Sequences
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- On the Number of Unbordered Factors
- Decidability and Enumeration for Automatic Sequences: A Survey
- Abelian squares are avoidable on 4 letters
- Abelian Repetitions in Sturmian Words
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
