Pages that link to "Item:Q2898445"
From MaRDI portal
The following pages link to Pattern \(1^{j+1}0^{j}\) avoiding binary words (Q2898445):
Displaying 10 items.
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern (Q544885) (← links)
- Gray code orders for \(q\)-ary words avoiding a given factor (Q748433) (← links)
- Binary words excluding a pattern and proper Riordan arrays (Q870961) (← links)
- Every binary pattern of length six is avoidable on the two-letter alphabet (Q1186515) (← links)
- A 2D non-overlapping code over a \(q\)-ary alphabet (Q1704207) (← links)
- Avoiding cross-bifix-free binary words (Q2377303) (← links)
- Pattern \(1^j0^i\) avoiding binary words (Q2789513) (← links)
- A generating function for bit strings with no Grand Dyck pattern matching (Q2973209) (← links)
- Algebraic generating functions for languages avoiding Riordan patterns (Q4637118) (← links)
- Counting binary words avoiding alternating patterns (Q5404314) (← links)