A note on constructing infinite binary words with polynomial subword complexity

DOI10.1051/ITA/2013033MaRDI QIDQ4928768zbMATH OpenOpenAlexFDO

Authors Bob Chen, Sinziana Munteanu, F. Blanchet-Sadri

Publication date 18 June 2013

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4b8c30eeec8c2907427ba1af419d56128fd1a142

zbMATH Keywords

binary wordsgap functionsubword complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• The subword complexity of a class of infinite binary words
• scientific article; zbMATH DE number 1948496
• Two infinite words with cubic subword complexity
• Constructing Infinite Words of Intermediate Arithmetical Complexity
• Constructing partial words with subword complexities not achievable by full words

Cited in

(5)

• The subword complexity of a class of infinite binary words
• Constructing Infinite Words of Intermediate Arithmetical Complexity
• scientific article; zbMATH DE number 1948496 (Why is no real title available?)
• Two infinite words with cubic subword complexity
• Polynomial versus exponential growth in repetition-free binary words

This page was built for publication: A note on constructing infinite binary words with polynomial subword complexity

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