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 …

Indeterminate strings are a subclass of non-standard words having non-deterministic nature.
In a classic string every position contains exactly one symbol—we say it is a solid symbol …

A string T of length m is periodic in P of length p if P is a substring of T and T [i]= T [i+ p] for all
0≤ i≤ m− p− 1 and m≥ 2 p. The shortest such prefix, P, is called the period of T (ie, P= T …

An indeterminate string x= x [1.. n] on an alphabet Σ is a sequence of nonempty subsets of Σ;
x is said to be regular if every subset is of size one. A proper substring u of regular x is said …

A\itbf {cover} of a string $ x= x [1.. n] $ is a proper substring $ u $ of $ x $ such that $ x $ can
be constructed from possibly overlapping instances of $ u $. A recent paper\cite …

We consider the problem of computing a solid cover of an indeterminate string. An
indeterminate string may contain non-solid symbols, each of which specifies a subset of the …

Regularities in indeterminate 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 …

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 …

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 of a …