A test-set fork-power-free binary morphisms
From MaRDI portal
Publication:3149084
DOI10.1051/ITA:2001104zbMATH Open1010.68102OpenAlexW2051434261MaRDI QIDQ3149084FDOQ3149084
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sharp characterizations of squarefree morphisms
- Primitive morphisms
- On cube-free \(\omega\)-words generated by binary morphisms
- Sequences generated by infinitely iterated morphisms
- A characterization of overlap-free morphisms
- On k-repetition freeness of length uniform morphisms over a binary alphabet
- A characterization of power-free morphisms
- Some results on \(k\)-power-free morphisms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterization of test-sets for overlap-free morphisms
- Title not available (Why is that?)
Cited In (12)
- Power-free complementary binary morphisms
- A characterization of power-free morphisms
- Title not available (Why is that?)
- Some results on \(k\)-power-free morphisms
- Overlap-free morphisms and finite test-sets
- Reduction in non-\((k+1)\)-power-free morphisms
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
- CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
- A uniform cube-free morphism is \(k\)-power-free for all integers \(k\geq 4\)
- On k-repetition freeness of length uniform morphisms over a binary alphabet
- Title not available (Why is that?)
- 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)
