A test-set fork-power-free binary morphisms

DOI10.1051/ITA:2001104MaRDI QIDQ3149084zbMATH OpenOpenAlexFDO

Authors Francis Wlazinski

Publication date 24 September 2002

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2001__35_5_437_0, https://eudml.org/doc/222091

zbMATH Keywords

binary morphism

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
• Some results on \(k\)-power-free morphisms
• scientific article; zbMATH DE number 1929972
• Overlap-free morphisms and finite test-sets
• Finite test sets for morphisms that are squarefree on some of Thue's squarefree ternary words
• Characterization of test-sets for overlap-free morphisms
• A characterization of power-free morphisms
• Explicit test sets for iterated morphisms in free monoids and metabelian groups
• CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
• On k-repetition freeness of length uniform morphisms over a binary alphabet

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3911729 (Why is no real title available?)
• scientific article; zbMATH DE number 3975229 (Why is no real title available?)
• scientific article; zbMATH DE number 1500510 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 3350192 (Why is no real title available?)
• A characterization of overlap-free morphisms
• A characterization of power-free morphisms
• Characterization of test-sets for overlap-free morphisms
• On cube-free \(\omega\)-words generated by binary morphisms
• On k-repetition freeness of length uniform morphisms over a binary alphabet
• Primitive morphisms
• Sequences generated by infinitely iterated morphisms
• Sharp characterizations of squarefree morphisms
• Some results on \(k\)-power-free morphisms

Cited in

(12)

• Overlap-free morphisms and finite test-sets
• scientific article; zbMATH DE number 3995996 (Why is no real title available?)
• CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
• A characterization of power-free morphisms
• A uniform cube-free morphism is \(k\)-power-free for all integers \(k\geq 4\)
• Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
• Some results on \(k\)-power-free morphisms
• scientific article; zbMATH DE number 1929972 (Why is no real title available?)
• Reduction in non-\((k+1)\)-power-free morphisms
• Power-free complementary binary morphisms
• On k-repetition freeness of length uniform morphisms over a binary alphabet
• Some non finitely generated monoids of repetition-free endomorphisms.

This page was built for publication: A test-set fork-power-free binary morphisms

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