{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:10:25Z","timestamp":1773943825976,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":7290,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0304-3975(93)90307-f","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"113-129","source":"Crossref","is-referenced-by-count":55,"title":["Context-free grammars, differential operators and formal power series"],"prefix":"10.1016","volume":"117","author":[{"given":"William Y.C.","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90307-F_BIB1","doi-asserted-by":"crossref","first-page":"9635","DOI":"10.1073\/pnas.87.24.9635","article-title":"A general bijective algorithm for trees","volume":"87","author":"Chen","year":"1990","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"10.1016\/0304-3975(93)90307-F_BIB2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.2307\/1967690","article-title":"Successive derivatives of a function of several functions","volume":"27","author":"Dederick","year":"1926","journal-title":"Ann. of Math."},{"key":"10.1016\/0304-3975(93)90307-F_BIB3","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\/0304-3975(93)90307-F_BIB4","first-page":"359","article-title":"Note sur une nouvelle formule de calcul diff\u00e9rentiel","volume":"1","author":"di Bruno","year":"1857","journal-title":"Quart. J. Math."},{"key":"10.1016\/0304-3975(93)90307-F_BIB5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1017\/S0305004100054402","article-title":"Formulae for high derivatives of composite functions","volume":"83","author":"Fraenkel","year":"1978","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0304-3975(93)90307-F_BIB6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0097-3165(80)90074-6","article-title":"A factorization for formal Laurent series and lattice path enumeration","volume":"32","author":"Gessel","year":"1980","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0304-3975(93)90307-F_BIB7","series-title":"The Mathematical Theory of Context-free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0304-3975(93)90307-F_BIB8","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/0097-3165(78)90062-6","article-title":"Formal languages and enumeration","volume":"24","author":"Goldman","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0304-3975(93)90307-F_BIB9","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1111\/j.1749-6632.1979.tb32794.x","article-title":"Formal languages and enumeration II","volume":"319","author":"Goldman","year":"1979","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/0304-3975(93)90307-F_BIB10","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-8858(92)90010-T","article-title":"Lattice path enumeration by formal schema","volume":"13","author":"Goldman","year":"1992","journal-title":"Adv. in. Appl. Math."},{"key":"10.1016\/0304-3975(93)90307-F_BIB11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/sapm197961293","article-title":"Coalgebras and bialgebras in combinatorics","volume":"61","author":"Joni","year":"1979","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/0304-3975(93)90307-F_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0001-8708(81)90052-9","article-title":"Une th\u00e9orie combinatoire des s\u00e9ries formelles","volume":"42","author":"Joyal","year":"1981","journal-title":"Adv. In Math."},{"key":"10.1016\/0304-3975(93)90307-F_BIB13","volume":"1","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(93)90307-F_BIB14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0001-8708(81)90041-4","article-title":"Une nouvelle d\u00e9monstration combinatoire des formules d'inversioin de Lagrange","volume":"42","author":"Labelle","year":"1981","journal-title":"Adv. in Math."},{"key":"10.1016\/0304-3975(93)90307-F_BIB15","series-title":"Combinatorics on Words","volume":"17","year":"1983"},{"key":"10.1016\/0304-3975(93)90307-F_BIB16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1090\/S0002-9947-1960-0114765-9","article-title":"Functional composition patterns and power series reversion","volume":"94","author":"Raney","year":"1960","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(93)90307-F_BIB17","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1090\/S0002-9904-1946-08621-8","article-title":"Derivatives of composite functions","volume":"52","author":"Riordan","year":"1946","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(93)90307-F_BIB18","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","year":"1958"},{"key":"10.1016\/0304-3975(93)90307-F_BIB19","doi-asserted-by":"crossref","first-page":"805","DOI":"10.2307\/2320788","article-title":"The formula of Fa\u00e0 di Bruno","volume":"87","author":"Roman","year":"1980","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0304-3975(93)90307-F_BIB20","series-title":"Finite Operator Calculus","author":"Rota","year":"1975"},{"key":"10.1016\/0304-3975(93)90307-F_BIB21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/sapm198879165","article-title":"Interpolation and combinatorial functions","volume":"79","author":"Verde-Star","year":"1988","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/0304-3975(93)90307-F_BIB22","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(84)90171-7","article-title":"A combinatorial proof of Newton's identities","volume":"49","author":"Zeilberger","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(93)90307-F_BIB23","first-page":"370","article-title":"Toward a combinatorial proof of the Jacobian conjecture","volume":"1234","author":"Zeilberger","year":"1986"},{"key":"10.1016\/0304-3975(93)90307-F_BIB24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1080\/00207168908803760","article-title":"Six etudes in generating functions","volume":"29","author":"Zeilberger","year":"1989","journal-title":"Internat. J. Comput. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390307F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390307F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:24:04Z","timestamp":1555129444000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390307F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["030439759390307F"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90307-f","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}