Covering a string
type: Item
instance of: scholarly article
title: Covering a string
zbMATH Open document ID: 0858.68067
DOI: 10.1007/BF01955677
author: Costas S. Iliopoulos
author: D. W. G. Moore
author: Kunsoo Park
published in: Algorithmica
publication date: 1996-10-16T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 936187
zbMATH Keywords: combinatorial algorithms on words
zbMATH Keywords: string algorithms
zbMATH Keywords: periodicity of strings
zbMATH Keywords: covering of strings
MaRDI profile type: Publication
cites work: Q4091421
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: Q3128912
cites work: The smallest automaton recognizing the subwords of a text
cites work: An on-line string superprimitivity test
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Transducers and repetitions
cites work: Fast Pattern Matching in Strings
full work available at URL: https://doi.org/10.1007/bf01955677
OpenAlex ID: W2121328026
description: scientific article; zbMATH DE number 936187