{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T23:10:17Z","timestamp":1775862617069,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6772,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0012-365x(93)e0147-v","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:07:16Z","timestamp":1027616836000},"page":"155-176","source":"Crossref","is-referenced-by-count":15,"title":["Two combinatorial statistics on Dyck paths"],"prefix":"10.1016","volume":"137","author":[{"given":"Alain","family":"Denise","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodica","family":"Simion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)E0147-V_bib1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0378-3758(93)90032-2","article-title":"Some q-analogues of the Schr\u00f6eder numbers arising from combinatorial statistics on lattice paths","volume":"34","author":"Bonin","year":"1993","journal-title":"J. Statist Plann. Inference"},{"key":"10.1016\/0012-365X(93)E0147-V_bib2","article-title":"q-\u00e9num\u00e9ration de polyominos convexes","volume":"9","author":"Bousquet-M\u00e9lou","year":"1991"},{"key":"10.1016\/0012-365X(93)E0147-V_bib3","doi-asserted-by":"crossref","unstructured":"M. Bosquet-M\u00e9lou, q-\u00e9num\u00e9ration de polyominos convexes, J. Combin. Theory Ser. A, to appear.","DOI":"10.1016\/0097-3165(93)90098-S"},{"key":"10.1016\/0012-365X(93)E0147-V_bib4","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1080\/00150517.1972.12430902","article-title":"Sequences, paths, ballot numbers","volume":"10","author":"Carlitz","year":"1972","journal-title":"Fibonacci Quart."},{"key":"10.1016\/0012-365X(93)E0147-V_bib5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1080\/00150517.1975.12430612","article-title":"A note on weighted sequences","volume":"13","author":"Carlitz","year":"1975","journal-title":"Fibonacci Quart."},{"key":"10.1016\/0012-365X(93)E0147-V_bib6","series-title":"Advanced Combinatorics","author":"Comtet","year":"1974"},{"key":"10.1016\/0012-365X(93)E0147-V_bib7","article-title":"Un code pour les graphes planaires et ses applications","volume":"27","author":"Cori","year":"1975"},{"key":"10.1016\/0012-365X(93)E0147-V_bib8","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.4153\/CJM-1981-078-2","article-title":"Planar maps are well labeled trees","volume":"33","author":"Cori","year":"1981","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(93)E0147-V_bib9","series-title":"Proc. Wrokshop on Attribute Grammars","first-page":"46","article-title":"Counting polyominoes using attribute grammars","volume":"Vol. 461","author":"Delest","year":"1990"},{"key":"10.1016\/0012-365X(93)E0147-V_bib10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-3975(92)90380-X","article-title":"Attribute grammars are useful for combinatorics","volume":"98","author":"Delest","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0012-365X(93)E0147-V_bib11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(84)90116-6","article-title":"Algebraic languages and polyominoes enumeration","volume":"34","author":"Delest","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0012-365X(93)E0147-V_bib12","series-title":"M\u00e9moire de DEA Informatique","article-title":"Etude des q-grammaires","author":"Denise","year":"1991"},{"key":"10.1016\/0012-365X(93)E0147-V_bib13","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(82)90118-2","article-title":"Multichains, non-crossing partitions and trees","volume":"40","author":"Edelman","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)E0147-V_bib14","article-title":"Grammaires et q-\u00e9num\u00e9ration de polyominos","author":"F\u00e9dou","year":"1989"},{"key":"10.1016\/0012-365X(93)E0147-V_bib15","doi-asserted-by":"crossref","unstructured":"J.M. F\u00e9dou, Enumeration of skew Ferrers diagrams and basic Bessel functions, J. Statist. Plann. Inference to appear.","DOI":"10.1016\/0378-3758(93)90037-7"},{"key":"10.1016\/0012-365X(93)E0147-V_bib16","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0097-3165(85)90089-5","article-title":"q-Catalan numbers","volume":"40","author":"F\u00fcrlinger","year":"1985","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(93)E0147-V_bib17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","article-title":"Semantics of context-free languages","volume":"2","author":"Knuth","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0012-365X(93)E0147-V_bib18","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0012-365X(72)90041-6","article-title":"Sur les partitions non crois\u00e9es d'un cycle","volume":"1","author":"Kreweras","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)E0147-V_bib19","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S0021-9800(69)80113-4","article-title":"On the number of certain lattice polygons","volume":"6","author":"P\u00f3lya","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(93)E0147-V_bib20","unstructured":"F.W. Schmidt, personal communication."},{"key":"10.1016\/0012-365X(93)E0147-V_bib21","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/S0019-9958(63)90306-1","article-title":"Context-free languages and pushdown automata","volume":"6","author":"Sch\u00fctzenberger","year":"1963","journal-title":"Information and Control"},{"key":"10.1016\/0012-365X(93)E0147-V_bib22","doi-asserted-by":"crossref","unstructured":"R. Simion, Combinatorial statitics on non-crossing partitions, J. Combin. Theory Ser. A, to appear.","DOI":"10.1016\/0097-3165(94)90066-3"},{"key":"10.1016\/0012-365X(93)E0147-V_bib23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0012-365X(91)90376-D","article-title":"On the structure of the lattice of non-crossing partitions","volume":"98","author":"Simion","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)E0147-V_bib24","author":"Sloane","year":"1979"},{"key":"10.1016\/0012-365X(93)E0147-V_bib25","series-title":"Mathematics in Medicine and Biology","first-page":"360","article-title":"Enumeration of RNA's secondary structures by complexity","volume":"57","author":"de Chaumont","year":"1985"},{"key":"10.1016\/0012-365X(93)E0147-V_bib26","series-title":"UQAM Conference Notes","article-title":"Une Th\u00e9orie Combinatoire des Polyn\u00f4mes Orthogonaux G\u00e9n\u00e9raux","author":"Viennot","year":"1983"},{"key":"10.1016\/0012-365X(93)E0147-V_bib27","series-title":"Proc. FCT '85","first-page":"450","article-title":"Enumerative combinatorics and algebraic languages","author":"Viennot","year":"1985"},{"key":"10.1016\/0012-365X(93)E0147-V_bib28","series-title":"Proc. 4\u00e8me Colloque S\u00e9ries Formelles et Combinatoire Alg\u00e9brique","first-page":"399","article-title":"A survey of polyominoes enumeration","volume":"11","author":"Viennot","year":"1992"},{"key":"10.1016\/0012-365X(93)E0147-V_bib29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(90)90047-L","article-title":"A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number","volume":"82","author":"Zeilberger","year":"1990","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0147V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0147V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T17:39:06Z","timestamp":1733333946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93E0147V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["0012365X93E0147V"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)e0147-v","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}