The following pages link to Closed factorization (Q313756):
Displaying 8 items.
- On closed-rich words (Q2117106) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words (Q2136272) (← links)
- Off-line and on-line algorithms for closed string factorization (Q2326384) (← links)
- The sequence of open and closed prefixes of a Sturmian word (Q2363308) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- Efficient Identification of k-Closed Strings (Q5859637) (← links)
- Finite and infinite closed-rich words (Q6140350) (← links)