Some combinatorial sequences associated with context-free grammars

Abstract

The purpose of this paper is to show that some combinatorial sequences, such as second-order Eulerian numbers and Eulerian numbers of type $B$, can be generated by context-free grammars.

arXiv comment7 pages

References in corpus (1)

• Context-free Grammars and Multivariate Stable Polynomials over Stirling Permutations

Cited by in corpus (1)

• Bessel polynomials, double factorials and context-free grammars