Journal article
COVERING A CIRCULAR STRING WITH SUBSTRINGS OF FIXED LENGTH
Abstract
A nonempty circular string C(x) of length n is said to be covered by a set U
k
Authors
DUVAL AM; SMYTH WF
Journal
International Journal of Foundations of Computer Science, Vol. 7, No. 01, pp. 87–93
Publisher
World Scientific Publishing
Publication Date
March 1996
DOI
10.1142/s0129054196000075
ISSN
0129-0541