On k-repetition freeness of length uniform morphisms over a binary alphabet
From MaRDI portal
Publication:799123
DOI10.1016/0166-218X(84)90028-3zbMath0547.68082MaRDI QIDQ799123
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (6)
Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms ⋮ Reduction in non-(k+ 1)-power-free morphisms ⋮ Dyck Words, Pattern Avoidance, and Automatic Sequences ⋮ A uniform cube-free morphism isk-power-free for all integersk≥ 4 ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) ⋮ A test-set fork-power-free binary morphisms
Cites Work
This page was built for publication: On k-repetition freeness of length uniform morphisms over a binary alphabet
