Context-free grammars for permutations and increasing trees
暂无分享,去创建一个
[1] Robert Donaghey,et al. Alternating Permutations and Binary Increasing Trees , 1975, J. Comb. Theory, Ser. A.
[2] D. Dumont. William Chen grammars and derivations in trees and arborescences. (Grammaires de William Chen et dérivations dans les arbres et arborescences.) , 1996 .
[3] Dominique Dumont,et al. Grammaire de Ramanujan et arbres de Cayley , 1996, Electron. J. Comb..
[4] Guo-Niu Han,et al. Arbres minimax et polynômes d'André , 2001, Adv. Appl. Math..
[5] James Haglund,et al. Stable multivariate Eulerian polynomials and generalized Stirling permutations , 2012, Eur. J. Comb..
[6] A. Kuznetsov,et al. Increasing trees and alternating permutations , 1994 .
[7] Ira M. Gessel,et al. Stirling Polynomials , 1978, J. Comb. Theory, Ser. A.
[8] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..
[9] Miklós Bóna,et al. Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley , 2007, SIAM J. Discret. Math..
[10] Shi-Mei Ma,et al. Derivative polynomials and enumeration of permutations by number of interior and left peaks , 2012, Discret. Math..
[11] William Y. C. Chen,et al. Context-Free Grammars, Differential Operators and Formal Power Series , 1993, Theor. Comput. Sci..
[12] D. Foata. CHAPTER 16 – Nombres d'Euler et Permutations Alternantes , 1973 .