Journal article
A correction to “An optimal algorithm to compute all the covers of a string”
Abstract
This note corrects an error in a paper recently published in this journal (An optimal algorithm to compute all the covers of a string, Inform. Process. Lett. 50 (5) (1994) 239–246). The correction consists primarily of a new subalgorithm which is called by COMPUTE-COVERS, the main algorithm presented in the paper referenced. It turns out that the new subalgorithm is itself sufficient to solve the original problem — that is, to compute all the …
Authors
Moore D; Smyth WF
Journal
Information Processing Letters, Vol. 54, No. 2, pp. 101–103
Publisher
Elsevier
Publication Date
April 1995
DOI
10.1016/0020-0190(94)00235-q
ISSN
0020-0190