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

DOI10.1016/J.DAM.2007.04.024zbMath1129.68053OpenAlexW2001169694MaRDI QIDQ2381820

Francis Wlazinski, Gwenaël Richomme

Publication date: 19 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.024

zbMATH Keywords

morphismscombinatorics on wordsFormal languages\(k\)-power-free wordstest-sets

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (4)

On the entropy and letter frequencies of powerfree words ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) ⋮ Periodicity, repetitions, and orbits of an automatic sequence ⋮ Cubic patterns with permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On k-repetition freeness of length uniform morphisms over a binary alphabet
• Avoidable patterns in strings of symbols
• Sharp characterizations of squarefree morphisms
• A characterization of overlap-free morphisms
• Some results on \(k\)-power-free morphisms
• Some non finitely generated monoids of repetition-free endomorphisms.
• Overlap-free morphisms and finite test-sets
• Characterization of test-sets for overlap-free morphisms
• Growth of repetition-free words -- a review
• CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
• A test-set fork-power-free binary morphisms
• Automatic Sequences
• If a DOL language is k-power free then it is circular

This page was built for publication: Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms