Attribute grammars are useful for combinatorics

DOI10.1016/0304-3975(92)90380-XzbMath0768.05006OpenAlexW1981323848WikidataQ127883897 ScholiaQ127883897MaRDI QIDQ1194317

Delest, Marie-Pierre, Jean-Marc Fedou

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90380-x

zbMATH Keywords

generating functionattribute grammarsbasic Bessel functionsskew Ferrers diagrams

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30) Grammars and rewriting systems (68Q42) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10) Polyominoes (05B50)

Related Items (13)

From object grammars to ECO systems ⋮ Two combinatorial statistics on Dyck paths ⋮ Probabilistic analysis of some (un)directed animals ⋮ Combinatorics of diagonally convex directed polyominoes ⋮ Attribute grammars and automatic complexity analysis ⋮ Object grammars and bijections. ⋮ Assessing the quality of multilevel graph clustering ⋮ Enumeration of skew Ferrers diagrams ⋮ On an involution on the Dyck paths ⋮ An involution on the Dyck paths ⋮ Enumeration of skew Ferrers diagrams and basic Bessel functions ⋮ Parallelogram polyominos with border and Bessel functions ⋮ \(Q\)-grammars and wall polyominoes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorics of q-Hermite polynomials and the Askey-Wilson integral
• The zeros of basic Bessel functions, the functions J(nu+ax)(x), and associated orthogonal polynomials
• On congruences and continued fractions for some classical combinatorial quantities
• Formal languages and enumeration
• Algebraic languages and polyominoes enumeration
• Planar Maps are Well Labeled Trees
• Some basic hypergeometric orthogonal polynomials that generalize Jacobi polynomials
• Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
• A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
• Identities in Combinatorics. II: A q-Analog of the Lagrange Inversion Theorem
• On the number of certain lattice polygons
• Covering Regions by Rectangles
• Tiling with polyominoes
• Semantics of context-free languages
• On a conjecture of Guinand for the plane partition function
• On context-free languages and push-down automata

This page was built for publication: Attribute grammars are useful for combinatorics