On the character of words of sublinear complexity

DOI10.4064/aa8577-3-2018zbMath1408.68126OpenAlexW2884699188WikidataQ129464209 ScholiaQ129464209MaRDI QIDQ4581961

Luca Q. Zamboni

Publication date: 21 August 2018

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa8577-3-2018

zbMATH Keywords

Sturmian wordszero entropylinear complexityfactor complexityArnoux-Rauzy wordsperiodic words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• A characterization of words of linear complexity
• Unnamed Item

This page was built for publication: On the character of words of sublinear complexity