Štěpán Holub

Binary equality sets are generated by two words

We show that the equality language of two non-periodic binary morphisms is generated by at most two words. If its rank is two, then the generators start (and end) with different letters. This in particular implies that any binary language has a test set of cardinality at most two.

Beyond the Runs Theorem

Recently, a short and elegant proof was presented showing that a binary word of length

Polynomial-time algorithm for fixed points of nontrivial morphisms

n

A proof of the extended Duval's conjecture

contains at most

INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE

n-3

On Upper and Lower Bounds on the Length of Alternating Towers

runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length

The Ehrenfeucht-Silberger problem

n

Proceedings 8th International Conference Words 2011

is at most

On highly palindromic words

\frac{22}{23}n<0.957n

On multiperiodic words

.