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 19 items.
- Squareable Words (Q3451095) (← links)
- Compatibility relations on codes and free monoids (Q3526416) (← links)
- Relationally Periodic Sequences and Subword Complexity (Q3533010) (← links)
- Equations on partial words (Q3549287) (← links)
- On a Special Class of Primitive Words (Q3599133) (← links)
- How Many Holes Can an Unbordered Partial Word Contain? (Q3618579) (← links)
- The theorem of Fine and Wilf for relational periods (Q3625689) (← links)
- A note on the number of squares in a partial word with one hole (Q3653094) (← links)
- Square-Free Partial Words with Many Wildcards (Q4683234) (← links)
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275) (← links)
- Combinatorial properties of Fibonacci partial words and arrays (Q5034979) (← links)
- Watson-Crick Partial Words (Q5055986) (← links)
- (Q5080935) (← links)
- On the number of squares in partial words (Q5190081) (← links)
- FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS (Q5495424) (← links)
- Partial words and a theorem of Fine and Wilf revisited (Q5958314) (← links)
- State complexity of finite partial languages (Q6100188) (← links)
- Lyndon partial words and arrays with applications (Q6111445) (← links)
- Adjunct partial array token Petri net structure (Q6166839) (← links)