A new approach to the periodicity lemma on strings with holes

DOI10.1016/J.TCS.2009.07.010zbMATH Open1181.68181OpenAlexW2162678883WikidataQ124849747 ScholiaQ124849747MaRDI QIDQ732016FDOQ732016

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

Recommendations

• A new approach to regular \& indeterminate strings
• Periodicity and roots of transfinite strings
• Periodic string complexes over string algebras
• The new periodicity lemma revisited
• Combinatorial Pattern Matching
• A New Periodicity Lemma
• Quasiperiodicity and string covering
• scientific article; zbMATH DE number 6316138
• scientific article; zbMATH DE number 7300355
• scientific article; zbMATH DE number 1092948

zbMATH Keywords

periodicityholeindeterminate string

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Uniqueness Theorems for Periodic Functions
• Fast pattern-matching on indeterminate strings
• Partial words and a theorem of Fine and Wilf
• Title not available (Why is that?)
• Partial words and a theorem of Fine and Wilf revisited
• Periodicity on partial words

Cited In (9)

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

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

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