Algebraic generating functions in enumerative combinatorics and context-free languages

DOI10.1007/978-3-540-31856-9_2MaRDI QIDQ5710678zbMATH OpenOpenAlexFDO

Authors Mireille Bousquet-Mélou

Publication date 2 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106485

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Formal languages and automata (68Q45)

Recommendations

• Rational and algebraic series in combinatorial enumeration
• scientific article; zbMATH DE number 3976367
• Six etudes in generating functions
• Asymptotics and algebraicity of some generating functions
• Coefficients of algebraic functions: formulae and asymptotics

Cited in

(21)

• Algebraic languages and polyominoes enumeration
• Hilbert series in the category of trees with contractions
• Enumerating regular expressions and their languages
• A method to prove the nonrationality of some combinatorial generating functions
• A robust class of linear recurrence sequences
• Troupes, cumulants, and stack-sorting
• Algebraic dependence in generating functions and expansion complexity
• Context-free grammars, generating functions and combinatorial arrays
• Analysis of generating functions for special words and numbers and algorithms for computation
• Enumerative combinatorics on words
• scientific article; zbMATH DE number 3976367 (Why is no real title available?)
• Six etudes in generating functions
• An algebra for proper generating trees
• scientific article; zbMATH DE number 4121470 (Why is no real title available?)
• Analytic aspects of the shuffle product
• A combinatorial description of finite O-sequences and ACM genera
• Formulae and asymptotics for coefficients of algebraic functions
• Coefficients of algebraic functions: formulae and asymptotics
• A technology for reverse-engineering a combinatorial problem from a rational generating function
• Context-free grammars, differential operators and formal power series
• Bidimensional linear recursive sequences and universality of unambiguous register automata

Describes a project that uses

Uses Software

• gfun
• ROTA

This page was built for publication: Algebraic generating functions in enumerative combinatorics and context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710678)