During the last two decades research on combinatorial problems of words, ie, on
Combinatorics on Words, has grown enormously. Although there has been important …

The discrete mathematics and theoretical computer science communities have recently
witnessed explosive growth in the area of algorithmic combinatorics on words. The next …

We use automata-theoretic approach to analyze properties of Fibonacci words. The directed
acyclic subword graph (dawg) is a useful deterministic automaton accepting all suffixes of …

The study of combinatorics on words, or finite sequences of symbols from a finite alphabet,
finds applications in several areas of biology, computer science, mathematics, and physics …

We investigate the three classes of accepting P systems considered so far, namely the P
automata of Csuhaj-Varjú, Vaszil [3], their variant introduced by Madhu, Krithivasan [10], and …

The relationship between the length of a word and the maximum length of its unbordered
factors is investigated in this article. Consider a finite word w of length n. We call a word …

In this paper, we consider one of the most fundamental results on the periodicity of words,
namely the critical factorization theorem. Given a word w and nonempty words u, v satisfying …

The border correlation function β: A*→ A*, for A={a, b}, specifies which conjugates (cyclic
shifts) of a given word w of length n are bordered, in other words, β (w)= c0c1... cn-1, where …

The class of finite Sturmian words consists of words having particularly simple compressed
representation, which is a generalization of the Fibonacci recurrence for Fibonacci words …

We prove that characteristic Sturmian words are extremal for the Critical Factorization
Theorem (CFT) in the following sense. If px (n) denotes the local period of an infinite word x …