Formal Languages, Automaton and Numeration Systems presents readers with a review of
research related to formal language theory, combinatorics on words or numeration systems …

The interplay between words, computability, algebra and arithmetic has now proved its
relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite …

Internationally recognised researchers look at developing trends in combinatorics with
applications in the study of words and in symbolic dynamics. They explain the important …

We introduce efficient data structures for an indexing problem in non-standard stringology—
jumbled pattern matching. Moosa and Rahman J. Discr. Alg., 2012 gave an index for …

We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a
string. An efficient algorithm for the latter problem was given by Cummings and Smyth in …

In 1961, Paul Erdös posed the question whether abelian squares can be avoided in
arbitrarily long words over a finite alphabet. An abelian square is a non-empty word uv …

Consider k-binomial equivalence: two finite words are equivalent if they share the same
subwords of length at most k with the same multiplicities. With this relation, the k-binomial …

We present efficient algorithms computing all Abelian periods of two types in a word.
Regular Abelian periods are computed in O (n log log {n}) randomized time which improves …

We show that the problem of whether the fixed point of a morphism avoids Abelian k-powers
is decidable under rather general conditions, the most important being that the frequency …

Recently, Constantinescu and Ilie proved a variant of the well-known periodicity theorem of
Fine and Wilf in the case of two relatively prime abelian periods and conjectured a result for …