Classifying all avoidable sets of partial words of size two

MaRDI QIDQ3018955zbMATH OpenFDO

Authors Brandon Blakeley, Josh Gunter, Sean Simmons, Eric Weissenstein, F. Blanchet-Sadri

Publication date 27 July 2011

zbMATH Keywords

Cayley graphstwo-element unavoidable sets of partial words

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorics on words (68R15)

Recommendations

• Unavoidable sets of partial words of uniform length
• Unavoidable sets of partial words
• Two Element Unavoidable Sets of Partial Words
• Minimum number of holes in unavoidable sets of partial words of size three
• Avoidable binary patterns in partial words

Cited in

(6)

• Number of holes in unavoidable sets of partial words. I.
• Testing avoidability on sets of partial words is hard
• Minimum number of holes in unavoidable sets of partial words of size three
• On sets of words of rank two
• Van der Waerden's Theorem and Avoidability in Words
• Unavoidable sets of partial words of uniform length

This page was built for publication: Classifying all avoidable sets of partial words of size two

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