Repetitive perhaps, but certainly not boring
type: Item
instance of: scholarly article
title: Repetitive perhaps, but certainly not boring
zbMATH Open document ID: 0949.68125
DOI: 10.1016/S0304-3975(00)00067-0
author: W. F. Smyth
published in: Theoretical Computer Science
publication date: 2000-10-26T00:00:00Z
review text: In this paper some of the work done on repetitions in strings is surveyed, especially that of an algorithmic nature. Several open problems are described and conjectures formulated about some of them.
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1521897
zbMATH Keywords: string
zbMATH Keywords: word
zbMATH Keywords: repetition
zbMATH Keywords: repeat
zbMATH Keywords: cover
MaRDI profile type: Publication
cites work: On the computational power of pushdown automata
cites work: Efficient detection of quasiperiodicities in strings
cites work: Optimal superprimitivity testing for strings
cites work: Optimal off-line detection of repetitions in a string
cites work: Avoidable patterns in strings of symbols
cites work: The subtree max gap problem with application to parallel string covering
cites work: Q4260376
cites work: An on-line string superprimitivity test
cites work: Descriptions of the Characteristic Sequence of an Irrational
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Q4351065
cites work: Open Problems in Pattern Avoidance
cites work: Strongly non-repetitive sequences and progression-free sets
cites work: Q3281093
cites work: Uniqueness Theorems for Periodic Functions
cites work: The exact number of squares in Fibonacci words
cites work: Algorithms on Strings, Trees and Sequences
cites work: Covering a string
cites work: A characterization of the squares in a Fibonacci string
cites work: On cube-free \(\omega\)-words generated by binary morphisms
cites work: Abelian squares are avoidable on 4 letters
cites work: Q4699311
cites work: Some combinatorial properties of Sturmian words
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: An optimal algorithm to compute all the covers of a string
cites work: Q5646912
cites work: Q3754068
cites work: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
cites work: Q3024803
cites work: Beatty Sequences, Continued Fractions, and Certain Shift Operators
cites work: Simple and flexible detection of contiguous repeats using a suffix tree
description: scientific article; zbMATH DE number 1521897