The following pages link to STACS 2005 (Q5710678):
Displaying 14 items.
- A combinatorial description of finite O-sequences and ACM genera (Q491249) (← links)
- Context-free grammars, differential operators and formal power series (Q688685) (← links)
- Algebraic languages and polyominoes enumeration (Q1348529) (← links)
- Hilbert series in the category of trees with contractions (Q2043099) (← links)
- Enumerating regular expressions and their languages (Q2074215) (← links)
- A robust class of linear recurrence sequences (Q2105454) (← links)
- Troupes, cumulants, and stack-sorting (Q2118918) (← links)
- Algebraic dependence in generating functions and expansion complexity (Q2176295) (← links)
- Context-free grammars, generating functions and combinatorial arrays (Q2422224) (← links)
- Analysis of generating functions for special words and numbers and algorithms for computation (Q2682861) (← links)
- Enumerative combinatorics on words (Q2704225) (← links)
- (Q4734780) (← links)
- Analytic aspects of the shuffle product (Q4910750) (← links)
- A technology for reverse-engineering a combinatorial problem from a rational generating function (Q5933434) (← links)