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

From MaRDI portal
Publication:390906

DOI10.1016/J.TCS.2013.03.001zbMATH Open1291.68302arXiv1207.3445OpenAlexW2964101747MaRDI QIDQ390906FDOQ390906


Authors: James D. Currie Edit this on Wikidata


Publication date: 9 January 2014

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

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.


Full work available at URL: https://arxiv.org/abs/1207.3445




Recommendations




Cites Work


Cited In (8)





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)