On minimal Sturmian partial words
From MaRDI portal
Publication:534335
DOI10.1016/J.DAM.2011.01.017zbMATH Open1217.68165OpenAlexW2116988080MaRDI QIDQ534335FDOQ534335
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/
Recommendations
Formal languages and automata (68Q45) Combinatorics on words (68R15) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- Enumerative combinatorics. Volume 2.
- Automatic Sequences
- Handbook of Graph Theory
- Représentation géométrique de suites de complexité $2n+1$
- Algorithmic Combinatorics on Partial Words
- On the complexity of infinite sequences
- Sequences with subword complexity \(2n\)
- Partial words and a theorem of Fine and Wilf
- Title not available (Why is that?)
- Complexity of sequences and dynamical systems
- Hard counting problems for partial words
- Binary de Bruijn partial words with one hole
- On minimal words with given subword complexity
- On minimal Sturmian partial words
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)
