The study of strings is an important combinatorial field that precedes t...
In this paper we describe two simple, fast, space-efficient algorithms f...
In this paper we propose a new, more appropriate definition of regular a...
In this note, we obtain an upper bound on the maximum number of distinct...
We introduce the Parikh-de-Bruijn grid, a graph whose vertices are
fixed...
In this paper we present an algorithm to compute the Lyndon array of a s...
Recently the Fibonacci word W on an infinite alphabet was introduced by
...