An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms

DOI10.1007/978-3-642-00982-2_16zbMath1234.68197OpenAlexW1549821250MaRDI QIDQ3618580

Elara Willett, Robert Mercaş, Abraham Rashin, Francine Blanchet-Sadri

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On the aperiodic avoidability of binary patterns with variables and reversals ⋮ Periodicity algorithms and a conjecture on overlaps in partial words ⋮ Avoiding Abelian squares in partial words

Cites Work

• Unnamed Item
• A generalization of Thue freeness for partial words
• Overlap-freeness in infinite partial words
• Freeness of partial words