Squares in binary partial words

DOI10.1007/978-3-642-31653-1_36MaRDI QIDQ3167513zbMATH OpenOpenAlexFDO

Authors Yang Jiao, John Machacek, F. Blanchet-Sadri

Publication date 2 November 2012

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31653-1_36

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Squares in partial words
• Counting distinct squares in partial words
• A note on the number of squares in a partial word with one hole
• Efficient enumeration of non-equivalent squares in partial words with few holes
• Avoiding large squares in partial words

Cited in

(16)

• How many squares must a binary sequence contain?
• Partial words with a unique position starting a square
• Existence of words over a binary alphabet free from squares with mismatches
• Squares in partial words
• Computing primitively-rooted squares and runs in partial words
• Squareable words
• A note on the number of squares in a partial word with one hole
• The three-squares lemma for partial words with one hole
• The simplest binary word with only three squares
• On the number of squares in partial words
• Counting distinct squares in partial words
• Avoiding large squares in partial words
• Efficient enumeration of non-equivalent squares in partial words with few holes
• Efficient enumeration of non-equivalent squares in partial words with few holes
• The number of positions starting a square in binary words
• Square-free partial words

This page was built for publication: Squares in binary partial words

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