Preprint
Computing Covers Using Prefix Tables
Abstract
An \emph{indeterminate string} $x = x[1..n]$ on an alphabet $\Sigma$ is a
sequence of nonempty subsets of $\Sigma$; $x$ is said to be \emph{regular} if
Authors
Alatabbi A; Rahman MS; Smyth WF
Publication date
December 9, 2014
DOI
10.48550/arxiv.1412.3016
Preprint server
arXiv