Algorithmic Combinatorics on Partial Words
From MaRDI portal
Publication:5310364
DOI10.1201/9781420060935zbMath1180.68205OpenAlexW2016376081MaRDI QIDQ5310364
Publication date: 11 October 2007
Full work available at URL: https://doi.org/10.1201/9781420060935
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Combinatorics on words (68R15)
Related Items
New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings, Squareable Words, Watson-Crick Partial Words, Computing covers using prefix tables, Recurrence in infinite partial words, On the complexity of deciding avoidability of sets of partial words, Covering problems for partial words and for indeterminate strings, Border correlations, lattices, and the subgraph component polynomial, Computing primitively-rooted squares and runs in partial words, Abelian-primitive partial words, Computing generalized de Bruijn sequences, Border Correlations, Lattices, and the Subgraph Component Polynomial, Computing the partial word avoidability indices of binary patterns, Computing the partial word avoidability indices of ternary patterns, Periods in partial words: an algorithm, Weak containment for partial words is coNP-complete, The three-squares lemma for partial words with one hole, Constructing partial words with subword complexities not achievable by full words, Unnamed Item, Squares in partial words, Number of holes in unavoidable sets of partial words. I., Avoiding Abelian squares in partial words, Abelian repetitions in partial words, A new approach to regular \& indeterminate strings, An algorithmic toolbox for periodic partial words, Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three, A note on the longest common compatible prefix problem for partial words, Indeterminate strings, prefix arrays \& undirected graphs, IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences, Streaming pattern matching with \(d\) wildcards, A prefix array for parameterized strings, On minimal Sturmian partial words, Computing regularities in strings: a survey, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS, Avoiding large squares in partial words, Unnamed Item, State complexity of finite partial languages, On the number of squares in partial words, Border correlations of partial words, Periodicity in data streams with wildcards, FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS, REMARKS ON TWO NONSTANDARD VERSIONS OF PERIODICITY IN WORDS, Regular languages of partial words, Unavoidable sets of partial words, How Many Holes Can an Unbordered Partial Word Contain?, On the Complexity of Deciding Avoidability of Sets of Partial Words, Avoidable binary patterns in partial words, A note on the number of squares in a partial word with one hole, State complexity of partial word finite automata, Squares and primitivity in partial words, Inferring an indeterminate string from a prefix graph, On the state complexity of partial word DFAs, State complexity of finite partial languages, Computing minimum length representations of sets of words of uniform length
