Partial words and a theorem of Fine and Wilf
From MaRDI portal
Publication:1292487
DOI10.1016/S0304-3975(98)00255-2zbMath0916.68120MaRDI QIDQ1292487
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Combinatorial properties of Fibonacci partial words and arrays, Local periods and binary partial words: an algorithm, Squareable Words, Watson-Crick Partial Words, On a special class of primitive words, Recurrence in infinite partial words, An aperiodicity problem for multiwords, Testing primitivity on partial words, A periodicity result of partial words with one hole, Two strings at Hamming distance 1 cannot be both quasiperiodic, String Periods in the Order-Preserving Model, Border correlations, lattices, and the subgraph component polynomial, Abelian-primitive partial words, Identifying codes on directed de Bruijn graphs, Periods in partial words: an algorithm, On universal partial words, Lyndon partial words and arrays with applications, The three-squares lemma for partial words with one hole, Adjunct partial array token Petri net structure, Constructing partial words with subword complexities not achievable by full words, Compatibility relations on codes and free monoids, Avoiding Abelian squares in partial words, Relationally Periodic Sequences and Subword Complexity, Abelian repetitions in partial words, Graph connectivity, partial words, and a theorem of Fine and Wilf, Periodicity on partial words, Partial words and the critical factorization theorem revisited, Equations on partial words, Streaming pattern matching with \(d\) wildcards, Relational codes of words, Freeness of partial words, Relations on words, Periodicity properties on partial words, Defect theorems with compatibility relations., On minimal Sturmian partial words, Computing regularities in strings: a survey, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS, Primitive partial words, Compatibility and conjugacy on partial arrays, Square-free partial words, Codes, orderings, and partial words, Partial words and the critical factorization theorem, Generalised fine and Wilf's theorem for arbitrary number of periods, Unnamed Item, State complexity of finite partial languages, On the number of squares in partial words, Combinatorics on partial word correlations, On a Special Class of Primitive Words, Square-Free Partial Words with Many Wildcards, FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS, Partial words and a theorem of Fine and Wilf revisited, Regular languages of partial words, A new approach to the periodicity lemma on strings with holes, String periods in the order-preserving model, A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE, Unavoidable sets of partial words, How Many Holes Can an Unbordered Partial Word Contain?, A generalization of Thue freeness for partial words, Overlap-freeness in infinite partial words, Testing avoidability on sets of partial words is hard, The theorem of Fine and Wilf for relational periods, Ternary Square-Free Partial Words with Many Wildcards, Partial array token Petri net and \(P\) system, Unbordered partial words, A note on the number of squares in a partial word with one hole, FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS, A local-global theorem on periodic maps, State complexity of partial word finite automata, Conjugacy on partial words., On the state complexity of partial word DFAs, Repetitions in Toeplitz words and the Thue threshold, Axiomatizing the subsumption and subword preorders on finite and infinite partial words, State complexity of finite partial languages, A periodicity lemma for partial words
Cites Work
