Some combinatorial sequences associated with context-free grammars

2012/08/15 by Shi-Mei Ma, Ma, Shi-Mei
Computer Science · Mathematics · #05A05 #05A15 #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1208.3104

openalex publication_date 2012/08/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Bessel polynomials, double factorials and context-free grammars
• Some combinatorial arrays related to the Lotka-Volterra system
• The Grammatical Calculus
• Context-free Grammars for Permutations and Increasing Trees
• How to enumerate trees from a context-free grammar