7 citations · 9 across the 4 of their papers we have counts for
6 papers
A New Approach to Regular & Indeterminate Strings
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist…
Palindromes in starlike trees
Amy Glen, Jamie Simpson, W. F. Smyth
In this note, we obtain an upper bound on the maximum number of distinct non-empty palindromes in starlike trees. This bound implies, in particular, that there are at most dis…
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…
Algorithms to Compute the Lyndon Array
Frantisek Franek, A. S. M. Sohidull Islam, M. Sohel Rahman +1
We first describe three algorithms for computing the Lyndon array that have been suggested in the literature, but for which no structured exposition has been given. Two of these al…
Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables
Ali Alatabbi, A. S. Sohidull Islam, M. Sohel Rahman +2
A \itbf{cover} of a string is a proper substring of such that can be constructed from possibly overlapping instances of . A recent paper \cite{FIKPPST1…
Inferring an Indeterminate String from a Prefix Graph
Ali Alatabbi, M. Sohel Rahman, W. F. Smyth
An \itbf{indeterminate string} (or, more simply, just a \itbf{string}) $\s{x} = \s{x}[1..n]$ on an alphabet is a sequence of nonempty subsets of . We say that $\s{x}[i_1]$ a…