Some combinatorial sequences associated with context-free grammars
Shi-Mei Ma
TL;DR
This paper demonstrates how certain combinatorial sequences like Eulerian numbers can be generated using context-free grammars, linking formal language theory with combinatorial enumeration.
Contribution
It introduces a novel approach to generate combinatorial sequences through context-free grammars, expanding their applications in combinatorics.
Findings
Second-order Eulerian numbers can be generated by context-free grammars.
Eulerian numbers of type B are also generated using this method.
The approach bridges formal language theory and combinatorial enumeration.
Abstract
The purpose of this paper is to show that some combinatorial sequences, such as second-order Eulerian numbers and Eulerian numbers of type , can be generated by context-free grammars.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Algorithms and Data Compression