Constructing partial words with subword complexities not achievable by full words
DOI10.1016/J.TCS.2012.01.039zbMATH Open1244.68063OpenAlexW2031089489MaRDI QIDQ428848FDOQ428848
Authors: Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich, F. Blanchet-Sadri 
Publication date: 25 June 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.039
Recommendations
combinatorics on wordspolynomial complexityautomata and formal languagespartial wordsintermediate complexitysubword complexity
Cites Work
- Title not available (Why is that?)
- Automatic Sequences
- Représentation géométrique de suites de complexité $2n+1$
- Title not available (Why is that?)
- Complexity and special factors
- Algorithmic Combinatorics on Partial Words
- On the complexity of infinite sequences
- Sequences with subword complexity \(2n\)
- Billiard complexity in rational polyhedra
- Complexity of trajectories in rectangular billiards
- Complexity of sequences defined by billiard in the cube
- Partial words and a theorem of Fine and Wilf
- Complexity of sequences and dynamical systems
- Rauzy's conjecture on billiards in the cube
- Toeplitz words, generalized periodicity and periodically iterated morphisms
- Complexity of Toeplitz sequences
- The subword complexity of a class of infinite binary words
- Hard counting problems for partial words
- Binary de Bruijn partial words with one hole
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Constructing partial words with subword complexities not achievable by full words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428848)
