{"paper":{"title":"Computing Covers Using Prefix Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, M. Sohel Rahman, W. F. Smyth","submitted_at":"2014-12-09T16:38:25Z","abstract_excerpt":"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 every subset is of size one. A proper substring $u$ of regular $x$ is said to be a \\emph{cover} of $x$ iff for every $i \\in 1..n$, an occurrence of $u$ in $x$ includes $x[i]$. The \\emph{cover array} $\\gamma = \\gamma[1..n]$ of $x$ is an integer array such that $\\gamma[i]$ is the longest cover of $x[1..i]$. Fifteen years ago a complex, though nevertheless linear-time, algorithm was proposed to compute the cover array of regular $x$ based on prior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3016","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}