Asymptotic behaviour of the maximal number of squares in standard Sturmian words
type: Item
instance of: scholarly article
zbMATH Open document ID: 1251.68174
DOI: 10.1142/S012905411240014X
author: Marcin Piatkowski
author: Wojciech Rytter
published in: International Journal of Foundations of Computer Science
publication date: 2012-08-30T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 6073945
zbMATH Keywords: Sturmian words
zbMATH Keywords: repetitions
zbMATH Keywords: data compression
MaRDI profile type: Publication
cites work: Automatic Sequences
cites work: Optimal off-line detection of repetitions in a string
cites work: USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Maximal repetitions in strings
cites work: Towards a Solution to the “Runs” Conjecture
cites work: Squares, cubes, and time-space efficient string searching
cites work: Jewels of Stringology
cites work: Powers in Sturmian sequences
cites work: The exact number of squares in Fibonacci words
cites work: How many squares can a string contain?
cites work: A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
cites work: A note on the number of squares in a word
cites work: A characterization of the squares in a Fibonacci string
cites work: Detecting leftmost maximal periodicities
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
cites work: The number of runs in a string
title: Asymptotic behaviour of the maximal number of squares in standard Sturmian words
description: scientific article; zbMATH DE number 6073945