Border correlations of partial words
From MaRDI portal
Publication:987385
DOI10.1007/S00224-008-9147-5zbMATH Open1205.68273OpenAlexW1973826500MaRDI QIDQ987385FDOQ987385
Authors: F. Blanchet-Sadri, Emily Clader, Olivia Simpson 
Publication date: 13 August 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://libres.uncg.edu/ir/uncg/f/F_Blanchet-Sadri_Border_2010.pdf
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Algorithmic Combinatorics on Partial Words
- Border correlation of binary words
- Partial words and the critical factorization theorem
- Partial words and the critical factorization theorem revisited
Cited In (10)
- Combinatorics on partial word borders
- How Many Holes Can an Unbordered Partial Word Contain?
- Border correlation of binary words
- Counting bordered partial words by critical positions
- Fully bordered words
- Bordered conjugates of words over large alphabets
- Correlations of Partial Words
- Border correlations, lattices, and the subgraph component polynomial
- Border correlations, lattices, and the subgraph component polynomial
- Unbordered partial words
This page was built for publication: Border correlations of partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987385)
