2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2017
Counting Lyndon factors
Amy Glen, Jamie Simpson, W. F. Smyth
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length can contain. We also derive formulas for the expected total number of Lyndon fac…
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…