Francis Wlazinski

activity

20052026

collaborators

4 papers

cs.FL2026

An overlap-free morphism is a k-power-free morphism for any integer k $\geq$ 3

Francis Wlazinski

We show that any overlap-free morphism is a $k$ -power-free morphism for all integers $k \geq 3$ .

cs.FL2026

Etude des morphismes pr{é}servant les mots primitifs

Francis Wlazinski

This article provides a reminder of some properties of primitive words and the morphisms that preserve them. Their proofs, which I have more or less revised, are included. This mak…

cs.FL2023

3-anti-power uniform morphisms

Francis Wlazinski

Words whose three successive factors of the same length are all different i.e. 3-anti-power words are a natural extension of square-free words (two successive factors of the same l…

cs.DM2005

Existence of finite test-sets for k-power-freeness of uniform morphisms

Gwénaël Richomme, Francis Wlazinski

A challenging problem is to find an algorithm to decide whether a morphism is k-power-free. We provide such an algorithm when k >= 3 for uniform morphisms showing that in such a ca…

An overlap-free morphism is a k-power-free morphism for any integer k ≥ 3

Etude des morphismes pr{é}servant les mots primitifs

3-anti-power uniform morphisms

Existence of finite test-sets for k-power-freeness of uniform morphisms

An overlap-free morphism is a k-power-free morphism for any integer k $\geq$ 3