Optimal word chains for the Thue-Morse word
From MaRDI portal
Publication:582129
DOI10.1016/0890-5401(89)90056-4zbMath0689.68097OpenAlexW2092064035MaRDI QIDQ582129
Publication date: 1989
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(89)90056-4
Related Items (3)
Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits ⋮ The number of minimal word chains computing the Thue-Morse word ⋮ On Bellman's and Knuth's problems and their generalizations
Cites Work
This page was built for publication: Optimal word chains for the Thue-Morse word