The study of strings is an important combinatorial field that precedes the digital computer.
Strings can be very long, trillions of letters, so it is important to find compact representations …

An indeterminate string (or, more simply, just a string) x= x [1.. n] on an alphabet Σ is a
sequence of nonempty subsets of Σ. We say that x [i 1] and x [i 2] match (written x [i 1]≈ x [i …

Many properties of a string can be viewed as sets of dependencies between substrings of
the string expressed in terms of substring equality. We design a linear-time algorithm which …

Covers, being one of the most popular form of regularities in strings, have drawn much
attention in the relevant literature. In this paper, we focus on the problem of linear-time …

Written text is considered as one of the oldest methods to represent knowledge. A text can
be defined as a logical and consistent sequence of symbols which encodes information in a …

Regularities in degenerate strings have recently been a matter of interest because of their
use in the fields of molecular biology, musical text analysis, cryptanalysis and so on. In this …