Note on decipherability of three-word codes.
Equations and dot-depth one.
Counting bordered partial words by critical positions.
On the semidirect product of the pseudovariety of semilattices by a locally finite pseudovariety of groups
Equations on the semidirect product of a finite semilattice by a -trivial monoid of height
On dot-depth two
On semidirect and two-sided semidirect products of finite trivial monoids
Equations on the semidirect product of a finite semilattice by a finite commutative monoid.
Abelian pattern avoidance in partial words
Pattern avoidance is an important topic in combinatorics on words which dates back to the beginning of the twentieth century when Thue constructed an infinite word over a ternary alphabet that avoids squares, , a word with no two adjacent identical factors. This result finds applications in various algebraic contexts where more general patterns than squares are considered. On the other hand, Erdős raised the question as to whether there exists an infinite word that avoids abelian squares, , a word...
Page 1