15 citations · 40 across the 14 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
On the Parikh-de-Bruijn grid
Péter Burcsi, Zsuzsanna Lipták, W. F. Smyth
We introduce the Parikh-de-Bruijn grid, a graph whose vertices are fixed-order Parikh vectors, and whose edges are given by a simple shift operation. This graph gives structural in…
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…