Pages that link to "Item:Q1757839"
From MaRDI portal
The following pages link to The maximal number of cubic runs in a word (Q1757839):
Displaying 16 items.
- The total run length of a word (Q391314) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- On the density of Lyndon roots in factors (Q507403) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Clusters of repetition roots forming prefix chains (Q2112177) (← links)
- Cartesian and Lyndon trees (Q2285120) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Linear construction of a left Lyndon tree (Q2672265) (← links)
- On the Maximal Number of Cubic Runs in a String (Q3564863) (← links)
- (Q3565863) (← links)
- The number of q-ary words with restrictions on the length of the maximal run (Q4522783) (← links)
- (Q5088889) (← links)
- Computing runs on a trie (Q5088914) (← links)
- The “Runs” Theorem (Q5359492) (← links)