Counting minimal semi-Sturmian words

DOI10.1016/J.DAM.2013.07.008MaRDI QIDQ2446875zbMATH OpenOpenAlexFDO

Authors F. Blanchet-Sadri, Sean Simmons

Publication date 23 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.07.008

zbMATH Keywords

Euler's totient functionsemi-Sturmian wordssubword complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Some characterizations of finite Sturmian words.
• Generalized balances in Sturmian words
• Sturmian and Episturmian Words
• Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
• Random generation of finite Sturmian words

Cites work

• A linear algorithm for nonhomogeneous spectra of numbers
• Balanced sequences and optimal routing
• Handbook of Graph Theory
• scientific article; zbMATH DE number 4107793 (Why is no real title available?)
• scientific article; zbMATH DE number 16592 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• On minimal Sturmian partial words
• On minimal words with given subword complexity
• On the number of factors of Sturmian words
• Random generation of finite Sturmian words
• Some characterizations of finite Sturmian words.
• Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)

Cited in

(3)

• Counting bordered and primitive words with a fixed weight
• Minimal Discriminating Words Problem Revisited
• Decomposition of Beatty and complementary sequences

This page was built for publication: Counting minimal semi-Sturmian words

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