Pages that link to "Item:Q766156"
From MaRDI portal
The following pages link to Avoidable binary patterns in partial words (Q766156):
Displaying 17 items.
- Strict bounds for pattern avoidance (Q393106) (← links)
- Computing the partial word avoidability indices of binary patterns (Q396698) (← links)
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- Number of holes in unavoidable sets of partial words. I. (Q450546) (← links)
- Every binary pattern of length six is avoidable on the two-letter alphabet (Q1186515) (← links)
- Unavoidable binary patterns (Q1323331) (← links)
- Characterization of some binary words with few squares (Q2348261) (← links)
- On the aperiodic avoidability of binary patterns with variables and reversals (Q2358690) (← links)
- Avoiding cross-bifix-free binary words (Q2377303) (← links)
- Pattern avoidance in partial words over a ternary alphabet (Q2517160) (← links)
- Binary patterns in binary cube-free words: Avoidability and growth (Q2934274) (← links)
- Computing Depths of Patterns (Q2953688) (← links)
- Unary Pattern Avoidance in Partial Words Dense with Holes (Q3004576) (← links)
- BINARY PATTERNS IN BINARY WORDS (Q4024637) (← links)
- On Long Words Avoiding Zimin Patterns (Q4636617) (← links)
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275) (← links)
- Partial matchings and pattern avoidance (Q5403605) (← links)