A characterization of power-free morphisms

DOI10.1016/0304-3975(85)90213-0zbMATH Open0572.68066OpenAlexW2074361486MaRDI QIDQ1062467FDOQ1062467

Authors: Michel Leconte 

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90213-0

Recommendations

• scientific article; zbMATH DE number 3911729
• Some results on \(k\)-power-free morphisms
• There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)
• A test-set fork-power-free binary morphisms
• ON ABELIAN POWER-FREE MORPHISMS

zbMATH Keywords

power-free words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Avoidable patterns in strings of symbols
• Title not available (Why is that?)
• Sharp characterizations of squarefree morphisms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• Power-free complementary binary morphisms
• The set of \(k\)-power free words over \(\Sigma\) is empty or perfect
• Square-free-preserving and primitive-preserving homomorphisms
• Some results on \(k\)-power-free morphisms
• A uniform cube-free morphism isk-power-free for all integersk≥ 4
• ON ABELIAN POWER-FREE MORPHISMS
• A test-set fork-power-free binary morphisms
• Overlap-free morphisms and finite test-sets
• Abelian squares are avoidable on 4 letters
• Title not available (Why is that?)
• Periodicity, repetitions, and orbits of an automatic sequence
• Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
• A characterization of overlap-free morphisms
• Title not available (Why is that?)
• CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
• Title not available (Why is that?)
• Reduction in non-(k+ 1)-power-free morphisms
• A powerful abelian square-free substitution over 4 letters
• On the centers of the set of weakly square-free words on a two letter alphabet
• On the entropy and letter frequencies of powerfree words
• On the structure and extendibility of \(k\)-power free words
• If a DOL language is k-power free then it is circular
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: A characterization of power-free morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062467)