Counting binary words avoiding alternating patterns
From MaRDI portal
Recommendations
Cited in
(15)- Pattern \(1^{j+1}0^{j}\) avoiding binary words
- Pattern 1ʲ⁰^i avoiding binary words
- scientific article; zbMATH DE number 5557896 (Why is no real title available?)
- Counting certain binary strings
- scientific article; zbMATH DE number 1868881 (Why is no real title available?)
- Pattern-avoiding alternating words
- Binary words excluding a pattern and proper Riordan arrays
- BINARY PATTERNS IN BINARY WORDS
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
- Avoiding cross-bifix-free binary words
- scientific article; zbMATH DE number 716160 (Why is no real title available?)
- On symbolic ultrametrics, cotree representations, and cograph edge decompositions and partitions
- A new combinatorial interpretation of partial sums of m-step Fibonacci numbers
- A construction for a class of binary words avoiding \(1^j0^i\)
- Algebraic generating functions for languages avoiding Riordan patterns
This page was built for publication: Counting binary words avoiding alternating patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404314)
