15 citations · 40 across the 14 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Computing Covers Using Prefix Tables
Ali Alatabbi, M. Sohel Rahman, W. F. Smyth
An \emph{indeterminate string} on an alphabet is a sequence of nonempty subsets of ; is said to be \emph{regular} if every subset is of size one. A proper…
cs.DM2014★ 2 cited
Indeterminate Strings, Prefix Arrays & Undirected Graphs
Manolis Christodoulakis, P. J. Ryan, W. F. Smyth +1
An integer array y = y[1..n] is said to be feasible if and only if y[1] = n and, for every i \in 2..n, i \le i+y[i] \le n+1. A string is said to be indeterminate if and only if at…