Pages that link to "Item:Q1186515"
From MaRDI portal
The following pages link to Every binary pattern of length six is avoidable on the two-letter alphabet (Q1186515):
Displaying 16 items.
- Avoidability index for binary patterns with reversal (Q252854) (← links)
- Strict bounds for pattern avoidance (Q393106) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- Grasshopper avoidance of patterns (Q727190) (← links)
- Unavoidable sets of partial words (Q733729) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- On abelian 2-avoidable binary patterns (Q877171) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- Unavoidable binary patterns (Q1323331) (← links)
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols (Q1753110) (← links)
- Patterns in words and languages (Q1765231) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Binary words avoided by the Thue-Morse sequence (Q1924519) (← links)
- On the aperiodic avoidability of binary patterns with variables and reversals (Q2358690) (← links)
- Long binary patterns are abelian 2-avoidable (Q2378523) (← links)
- THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE (Q5483466) (← links)
