Infinite ternary square-free words concatenated from permutations of a single word

From MaRDI portal
(Redirected from Publication:390906)




Abstract: We answer a question of Harju: An infinite square-free ternary word with an n-stem factorization exists for any nge13. We show that there are uniform ternary morphisms of length k for every kge23. This resolves almost completely a problem of the author and Rampersad.









This page was built for publication: Infinite ternary square-free words concatenated from permutations of a single word

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