Lattice path enumeration by formal schema

DOI10.1016/0196-8858(92)90010-TzbMath0767.05008OpenAlexW2028731145MaRDI QIDQ1197397

Jay R. Goldman, Thomas S. Sundquist

Publication date: 16 January 1993

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(92)90010-t

zbMATH Keywords

lattice path enumerationwordformal schemarooted plane tree

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Formal languages and automata (68Q45) Special sequences and polynomials (11B83)

Related Items (4)

A combinatorial study of the growing altitude elementary paths of the plane lattice Z² ⋮ Context-free grammars, differential operators and formal power series ⋮ Underdiagonal lattice paths with unrestricted steps ⋮ The area determined by underdiagonal lattice paths

Cites Work

• Chain enumeration and non-crossing partitions
• Combinatorial aspects of continued fractions
• Formal languages and enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lattice path enumeration by formal schema