On minimal Sturmian partial words

DOI10.1016/j.dam.2011.01.017zbMath1217.68165OpenAlexW2116988080MaRDI QIDQ534335

John Lensmire, Francine Blanchet-Sadri

Publication date: 17 May 2011

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

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2011/3013/

zbMATH Keywords

Sturmian wordsubword complexitypartial word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Number-theoretic algorithms; complexity (11Y16)

Related Items

Counting minimal semi-Sturmian words, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial words and a theorem of Fine and Wilf
• Complexity of sequences and dynamical systems
• Sequences with subword complexity \(2n\)
• On the complexity of infinite sequences
• On minimal words with given subword complexity
• Hard Counting Problems for Partial Words
• Binary De Bruijn Partial Words with One Hole
• Représentation géométrique de suites de complexité $2n+1$
• Automatic Sequences
• Handbook of Graph Theory
• Algorithmic Combinatorics on Partial Words