A new approach to the periodicity lemma on strings with holes
From MaRDI portal
Publication:732016
DOI10.1016/j.tcs.2009.07.010zbMath1181.68181WikidataQ124849747 ScholiaQ124849747MaRDI QIDQ732016
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
68R15: Combinatorics on words
Related Items
Computing covers using prefix tables, The three-squares lemma for partial words with one hole, Indeterminate strings, prefix arrays \& undirected graphs, Border correlations, lattices, and the subgraph component polynomial, Streaming pattern matching with \(d\) wildcards, Computing regularities in strings: a survey, Periods in partial words: an algorithm, A periodicity lemma for partial words, A new approach to regular \& indeterminate strings
Cites Work