On minimal Sturmian partial words

DOI10.1016/J.DAM.2011.01.017MaRDI QIDQ534335zbMATH OpenOpenAlexFDO

Authors John Lensmire, F. 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 wordpartial wordsubword complexity

Mathematics Subject Classification ID

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

Recommendations

• On minimal Sturmian partial words
• Constructing partial words with subword complexities not achievable by full words
• Binary de Bruijn partial words with one hole
• Recurrent partial words
• Recurrent Partial Words and Representable Sets.

Cites work

• scientific article; zbMATH DE number 3505007 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Algorithmic Combinatorics on Partial Words
• Automatic Sequences
• Binary de Bruijn partial words with one hole
• Complexity of sequences and dynamical systems
• Enumerative combinatorics. Volume 2.
• Handbook of Graph Theory
• Hard counting problems for partial words
• On minimal Sturmian partial words
• On minimal words with given subword complexity
• On the complexity of infinite sequences
• Partial words and a theorem of Fine and Wilf
• Représentation géométrique de suites de complexité $2n+1$
• Sequences with subword complexity \(2n\)

Cited in

(7)

• On minimal Sturmian partial words
• Algorithmic combinatorics on partial words
• Counting minimal semi-Sturmian words
• Constructing partial words with subword complexities not achievable by full words
• Recurrent partial words
• Binary de Bruijn partial words with one hole
• On the structure of bispecial Sturmian words

This page was built for publication: On minimal Sturmian partial words

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