On the average number of regularities in a word

DOI10.1016/J.TCS.2013.10.007zbMath1294.68116OpenAlexW2065388439WikidataQ61677852 ScholiaQ61677852MaRDI QIDQ2437740

Maxime Crochemore, Manolis Christodoulakis, Michalis Christou, Costas S. Iliopoulos

Publication date: 13 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.10.007

zbMATH Keywords

regularitiespowerspalindromesrunsabelian squaresfinite wordsabelian cubes

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

Abelian-square-rich words ⋮ \((k,\lambda)\)-anti-powers and other patterns in words ⋮ Words with the Maximum Number of Abelian Squares ⋮ Abelian combinatorics on words: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ``runs conjecture
• How many runs can a string contain?
• How many squares can a string contain?
• How many square occurrences must a binary sequence contain?
• A note on the number of squares in a word
• The number of runs in a string
• Abelian borders in binary words
• A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
• Towards a Solution to the “Runs” Conjecture
• AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
• Bounds on Powers in Strings
• Not So Many Runs in Strings
• On the Maximal Number of Cubic Runs in a String
• NUMBER OF OCCURRENCES OF POWERS IN STRINGS
• A Series of Run-Rich Strings
• On the Maximal Number of Cubic Subwords in a String
• A note on the number of squares in a partial word with one hole
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound

This page was built for publication: On the average number of regularities in a word