Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects
From MaRDI portal
Recommendations
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
- Analytic combinatorics of lattice paths with forbidden patterns: asymptotic aspects and Borges's theorem
- Generating functions for lattice paths with several forbidden patterns
- Algebraic generating functions for languages avoiding Riordan patterns
- Basic analytic combinatorics of directed lattice paths
Cited in
(10)- Basic analytic combinatorics of directed lattice paths
- On the generating functions of pattern-avoiding Motzkin paths
- Computational aspects of sturdy and flimsy numbers
- Generating functions for lattice paths with several forbidden patterns
- Structure of the space of taboo-free sequences
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
- Analytic combinatorics of lattice paths with forbidden patterns: asymptotic aspects and Borges's theorem
- Combinatorial generation via permutation languages. VI: Binary trees
- Pattern-avoiding binary trees -- generation, counting, and bijections
- Grand zigzag knight's paths
This page was built for publication: Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647701)