A new approach to the periodicity lemma on strings with holes

DOI10.1016/J.TCS.2009.07.010zbMath1181.68181OpenAlexW2162678883WikidataQ124849747 ScholiaQ124849747MaRDI QIDQ732016

W. F. Smyth, Shu Wang

Publication date: 9 October 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.010

zbMATH Keywords

periodicityholeindeterminate string

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (9)

Computing covers using prefix tables ⋮ Border correlations, lattices, and the subgraph component polynomial ⋮ Periods in partial words: an algorithm ⋮ The three-squares lemma for partial words with one hole ⋮ A new approach to regular \& indeterminate strings ⋮ Indeterminate strings, prefix arrays \& undirected graphs ⋮ Streaming pattern matching with \(d\) wildcards ⋮ Computing regularities in strings: a survey ⋮ A periodicity lemma for partial words

Cites Work

• Unnamed Item
• Unnamed Item
• Fast pattern-matching on indeterminate strings
• Partial words and a theorem of Fine and Wilf
• Periodicity on partial words
• Uniqueness Theorems for Periodic Functions
• Partial words and a theorem of Fine and Wilf revisited

This page was built for publication: A new approach to the periodicity lemma on strings with holes