Optimal word chains for the Thue-Morse word

DOI10.1016/0890-5401(89)90056-4zbMath0689.68097OpenAlexW2092064035MaRDI QIDQ582129

André Arnold, Srečko Brlek

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

zbMATH Keywords

complexity measure for languagesWord chains

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

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

• Unnamed Item
• Unnamed Item
• On the length of word chains
• Enumeration of factors in the Thue-Morse word

This page was built for publication: Optimal word chains for the Thue-Morse word