Counting binary words avoiding alternating patterns
From MaRDI portal
Recommendations
Cited in
(15)- Avoiding cross-bifix-free binary words
- Pattern 1ʲ⁰^i avoiding binary words
- Pattern \(1^{j+1}0^{j}\) avoiding binary words
- Pattern-avoiding alternating words
- On symbolic ultrametrics, cotree representations, and cograph edge decompositions and partitions
- scientific article; zbMATH DE number 5557896 (Why is no real title available?)
- BINARY PATTERNS IN BINARY WORDS
- scientific article; zbMATH DE number 716160 (Why is no real title available?)
- Algebraic generating functions for languages avoiding Riordan patterns
- scientific article; zbMATH DE number 1868881 (Why is no real title available?)
- A construction for a class of binary words avoiding 1ʲ⁰^i
- Counting certain binary strings
- A new combinatorial interpretation of partial sums of m-step Fibonacci numbers
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
- Binary words excluding a pattern and proper Riordan arrays
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)