Pages that link to "Item:Q1292479"
From MaRDI portal
The following pages link to On the combinatorics of finite words (Q1292479):
Displayed 21 items.
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- A periodicity result of partial words with one hole (Q597324) (← links)
- On average sequence complexity (Q703547) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Rich, Sturmian, and trapezoidal words (Q955036) (← links)
- Complexity for finite factors of infinite sequences (Q1292491) (← links)
- A combinatorial problem on trapezoidal words. (Q1605325) (← links)
- A combinatorial property of the factor poset of a word (Q1847375) (← links)
- Conjugacy on partial words. (Q1853530) (← links)
- Semiperiodic words and root-conjugacy. (Q1853735) (← links)
- Uniform words (Q1883404) (← links)
- Local periods and binary partial words: an algorithm (Q1884922) (← links)
- Algorithms for subsequence combinatorics (Q2378518) (← links)
- Some characterizations of finite Sturmian words. (Q2490813) (← links)
- Pseudopalindrome closure operators in free monoids (Q2508984) (← links)
- Efficient Reconstruction of RC-Equivalent Strings (Q3000522) (← links)
- Rich and Periodic-Like Words (Q3637220) (← links)
- On the distribution of characteristic parameters of words (Q4800266) (← links)
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES (Q5483374) (← links)
- Words and special factors (Q5941274) (← links)
- Partial words and a theorem of Fine and Wilf revisited (Q5958314) (← links)