Pages that link to "Item:Q1292487"
From MaRDI portal
The following pages link to Partial words and a theorem of Fine and Wilf (Q1292487):
Displayed 50 items.
- Abelian-primitive partial words (Q388787) (← links)
- The three-squares lemma for partial words with one hole (Q418740) (← links)
- Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
- Relations on words (Q505060) (← links)
- On minimal Sturmian partial words (Q534335) (← links)
- Generalised fine and Wilf's theorem for arbitrary number of periods (Q557915) (← links)
- A periodicity result of partial words with one hole (Q597324) (← links)
- Avoiding Abelian squares in partial words (Q645980) (← links)
- Abelian repetitions in partial words (Q651057) (← links)
- Codes, orderings, and partial words (Q706621) (← links)
- Regular languages of partial words (Q726150) (← links)
- A new approach to the periodicity lemma on strings with holes (Q732016) (← links)
- Unavoidable sets of partial words (Q733729) (← links)
- On a special class of primitive words (Q844893) (← links)
- Testing primitivity on partial words (Q868383) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Periodicity properties on partial words (Q948072) (← links)
- Square-free partial words (Q975472) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- Overlap-freeness in infinite partial words (Q1006076) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- Unbordered partial words (Q1028413) (← links)
- Periodicity on partial words (Q1433084) (← links)
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- On universal partial words (Q1689916) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Partial words and the critical factorization theorem (Q1770435) (← links)
- Conjugacy on partial words. (Q1853530) (← links)
- Local periods and binary partial words: an algorithm (Q1884922) (← links)
- Periods in partial words: an algorithm (Q1932359) (← links)
- Compatibility and conjugacy on partial arrays (Q2013016) (← links)
- String periods in the order-preserving model (Q2288212) (← links)
- On the state complexity of partial word DFAs (Q2344741) (← links)
- Two strings at Hamming distance 1 cannot be both quasiperiodic (Q2404618) (← links)
- Identifying codes on directed de Bruijn graphs (Q2416416) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- Relational codes of words (Q2465641) (← links)
- Freeness of partial words (Q2465643) (← links)
- Defect theorems with compatibility relations. (Q2480767) (← links)
- Primitive partial words (Q2486065) (← links)
- A local-global theorem on periodic maps (Q2575724) (← links)
- Recurrence in infinite partial words (Q2637347) (← links)
- Ternary Square-Free Partial Words with Many Wildcards (Q2817387) (← links)
- An aperiodicity problem for multiwords (Q2911425) (← links)
- FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS (Q3056274) (← links)
- A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE (Q3069745) (← links)
- (Q3304137) (← links)