The following pages link to Unbordered partial words (Q1028413):
Displaying 11 items.
- Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- Counting bordered partial words by critical positions (Q551232) (← links)
- Combinatorics on partial word borders (Q897922) (← links)
- Biinfinite words with maximal recurrent unbordered factors. (Q1401214) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- Fully bordered words (Q2358697) (← links)
- Unbordered factors and Lyndon words (Q2483406) (← links)
- On the Language of Primitive Partial Words (Q2799195) (← links)
- On Maximal Unbordered Factors (Q2942272) (← links)
- How Many Holes Can an Unbordered Partial Word Contain? (Q3618579) (← links)