Computing Covers Using Prefix Tables

Ali Alatabbi, M. Sohel Rahman, W. F. Smyth

An \emph{indeterminate string} $x=x[\mathrm{1..}n]$ on an alphabet $\Sigma$ is a sequence of nonempty subsets of $\Sigma$; $x$ is said to be \emph{regular} if every subset is of size one. A proper…