Partial words and a theorem of Fine and Wilf
From MaRDI portal
Publication:1292487
DOI10.1016/S0304-3975(98)00255-2zbMATH Open0916.68120MaRDI QIDQ1292487FDOQ1292487
Recommendations
- Partial words and a theorem of Fine and Wilf revisited
- Fine and Wilf's theorem for partial words with arbitrarily many weak periods
- Partial words and the critical factorization theorem
- Partial words and the critical factorization theorem revisited
- On Fine and Wilf's theorem for bidimensional words.
- A generalization of Thue freeness for partial words
- Freeness of partial words
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- Open problems on partial words
Cites Work
Cited In (79)
- Abelian repetitions in partial words
- On minimal Sturmian partial words
- Testing primitivity on partial words
- Algorithmic combinatorics on partial words
- Fine and Wilf's theorem for \(k\)-abelian periods
- Regular languages of partial words
- On the number of squares in partial words
- How Many Holes Can an Unbordered Partial Word Contain?
- Lyndon partial words and arrays with applications
- The three-squares lemma for partial words with one hole
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words
- Constructing partial words with subword complexities not achievable by full words
- Relational codes of words
- Generalised fine and Wilf's theorem for arbitrary number of periods
- Partial words and a theorem of Fine and Wilf revisited
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Computing regularities in strings: a survey
- On a special class of primitive words
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- Streaming pattern matching with \(d\) wildcards
- A periodicity result of partial words with one hole
- Relationally Periodic Sequences and Subword Complexity
- An account of speciality of partial words with respect to periodicity
- Compatibility relations on codes and free monoids
- Fine and Wilf's theorem for partial words with arbitrarily many weak periods
- The theorem of Fine and Wilf for relational periods
- Conjugacy on partial words.
- Square-free partial words
- Unavoidable sets of partial words
- A generalization of Thue freeness for partial words
- Overlap-freeness in infinite partial words
- A note on the number of squares in a partial word with one hole
- A local-global theorem on periodic maps
- Testing avoidability on sets of partial words is hard
- A new approach to the periodicity lemma on strings with holes
- Partial words and the critical factorization theorem
- Weak containment for partial words is coNP-complete
- Partial words and the critical factorization theorem revisited
- On universal partial words
- Periodicity on partial words
- Combinatorics on partial word correlations
- Border correlations, lattices, and the subgraph component polynomial
- Title not available (Why is no real title available?)
- Square-free partial words with many wildcards
- Plain and Twisted Adjoints of Well-Formed Words
- Local periods and binary partial words: an algorithm
- Periods in partial words: an algorithm
- Avoiding Abelian squares in partial words
- Primitive partial words
- Periodicity properties on partial words
- Unbordered partial words
- A periodicity lemma for partial words
- Relations on words
- Identifying codes on directed de Bruijn graphs
- Freeness of partial words
- Equations on partial words
- Codes, orderings, and partial words
- On a Special Class of Primitive Words
- Abelian-primitive partial words
- On the state complexity of partial word DFAs
- Repetitions in Toeplitz words and the Thue threshold
- A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE
- State complexity of finite partial languages
- Two strings at Hamming distance 1 cannot be both quasiperiodic
- An aperiodicity problem for multiwords
- String Periods in the Order-Preserving Model
- Compatibility and conjugacy on partial arrays
- Defect theorems with compatibility relations.
- Recurrence in infinite partial words
- Adjunct partial array token Petri net structure
- State complexity of finite partial languages
- Combinatorial properties of Fibonacci partial words and arrays
- Partial array token Petri net and \(P\) system
- String periods in the order-preserving model
- On a theorem concerning partially overlapping subpalindromes of a binary word
- Squareable words
- Watson-Crick Partial Words
- Ternary square-free partial words with many wildcards
- State complexity of partial word finite automata
This page was built for publication: Partial words and a theorem of Fine and Wilf
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292487)
