{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:23Z","timestamp":1759335983288},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":7747,"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":[[1992,5]]},"DOI":"10.1016\/0304-3975(92)90380-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"65-76","source":"Crossref","is-referenced-by-count":10,"title":["Attribute grammars are useful for combinatorics"],"prefix":"10.1016","volume":"98","author":[{"given":"M.P.","family":"Delest","sequence":"first","affiliation":[]},{"given":"J.M.","family":"Fedou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90380-X_BIB1","unstructured":"E. Ahronovitz and M. Habib, CICC: un logiciel de compression d'images par codes de contours, Preprint Ecole des Mines, Saint-Etienne, France."},{"key":"10.1016\/0304-3975(92)90380-X_BIB2","first-page":"240","article-title":"Identities in combinatorics II. A q-analog of the Lagrange inversion theorem","volume":"53","author":"Andrews","year":"1975","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(92)90380-X_BIB3","article-title":"The theory of plane partitions","volume":"Vol. 2","author":"Andrews","year":"1976"},{"key":"10.1016\/0304-3975(92)90380-X_BIB4","series-title":"q-S\u00e9ries: Their Development and Application in Analysis. Number Theory, Combinatorics, Physics, and Computer Algebra","author":"Andrews","year":"1986"},{"key":"10.1016\/0304-3975(92)90380-X_BIB5","series-title":"Special Functions: Group Theoretical Aspects and Applications","year":"1984"},{"key":"10.1016\/0304-3975(92)90380-X_BIB6","article-title":"Some basic hypergeometric polynomials that generalize Jacobi polynomials","volume":"318","author":"Askey","year":"1985","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(92)90380-X_BIB7","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1137\/0602042","article-title":"Covering regions by rectangles","volume":"2","author":"Chaiken","year":"1981","journal-title":"SIAM J. Discrete and Algebraic Methods"},{"key":"10.1016\/0304-3975(92)90380-X_BIB8","article-title":"Un code pour les graphes planaires et ses applications","volume":"27","author":"Cori","year":"1975","journal-title":"Ast\u00e9risque"},{"key":"10.1016\/0304-3975(92)90380-X_BIB9","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.4153\/CJM-1981-078-2","article-title":"Planars maps are well labeled trees","volume":"33","author":"Cori","year":"1981","journal-title":"Can. J. Math."},{"key":"10.1016\/0304-3975(92)90380-X_BIB10","series-title":"Methods and Tools for Compiler Construction","first-page":"81","article-title":"Attribute grammars","author":"Courcelle","year":"1983"},{"key":"10.1016\/0304-3975(92)90380-X_BIB11","article-title":"Utilisation des langages alg\u00e9briques et ducalcul formel pour le codage et l'\u00e9num\u00e9ration des polyominos","volume":"I","author":"Delest","year":"1987","journal-title":"Th\u00e8se d'Etat, Universit\u00e9 de Bordeaux"},{"key":"10.1016\/0304-3975(92)90380-X_BIB12","author":"Delest","year":"1989","journal-title":"Enumeration of skew Ferrers diagrams"},{"key":"10.1016\/0304-3975(92)90380-X_BIB13","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(92)90380-X_BIB14","article-title":"Grammaires et q-\u00e9num\u00e9rations de polyominos","author":"Fedou","year":"1989","journal-title":"Th\u00e8se de l'Universit\u00e9 de Bordeaux I"},{"key":"10.1016\/0304-3975(92)90380-X_BIB15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0012-365X(82)90201-1","article-title":"Combinatorial aspects of continued fractions","volume":"41","author":"Flajolet","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(92)90380-X_BIB16","series-title":"Compte rendu du S\u00e9minaire d'Informatique Th\u00e9orique LITP ann\u00e9e","first-page":"37","article-title":"Aspcts combinatoires du calcul des q-s\u00e9ries","author":"Foata","year":"1981"},{"key":"10.1016\/0304-3975(92)90380-X_BIB17","first-page":"205","article-title":"A q-analogue of the Lagrange inversion formula","volume":"7","author":"Garsia","year":"1981","journal-title":"Houston J. Math."},{"key":"10.1016\/0304-3975(92)90380-X_BIB18","first-page":"455","article-title":"A noncommutative generalization and q-analog of the Lagrange inversion formula","volume":"257","author":"Gessel","year":"1980","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(92)90380-X_BIB19","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(92)90380-X_BIB20","series-title":"Polyominoes","author":"Golomb","year":"1965"},{"key":"10.1016\/0304-3975(92)90380-X_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-247X(82)90248-7","article-title":"The zero of basic Bessel functions and associated orthogonal polynomials","volume":"86","author":"Ismail","year":"1982","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0304-3975(92)90380-X_BIB22","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0195-6698(87)80046-X","article-title":"The combinatorics of q-Hermite polynomials and the Askey-Wilson integrals","volume":"8","author":"Ismail","year":"1987","journal-title":"European J. Combin."},{"key":"10.1016\/0304-3975(92)90380-X_BIB23","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\/0304-3975(92)90380-X_BIB24","series-title":"Methods and Tools for Compiler Construction","author":"Lorho","year":"1983"},{"key":"10.1016\/0304-3975(92)90380-X_BIB25","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":"Polya","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0304-3975(92)90380-X_BIB26","series-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0304-3975(92)90380-X_BIB27","series-title":"Proc. Symp. on Mathematical Theory of Automata","first-page":"139","article-title":"Certain elementary families of automata","author":"Sch\u00fctzenberger","year":"1962"},{"key":"10.1016\/0304-3975(92)90380-X_BIB28","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":"Inform. and Control"},{"key":"10.1016\/0304-3975(92)90380-X_BIB29","series-title":"Proc. Workshop on Graph-theoretic Concepts in Computer Science","first-page":"1","article-title":"Periodic storage schemes with minimum number of memory banks","author":"Van Leeuwen","year":"1983"},{"key":"10.1016\/0304-3975(92)90380-X_BIB30","series-title":"Une th\u00e9orie combinatoire des polyn\u00f4mes orthogonaux g\u00e9n\u00e9raux","author":"Viennot","year":"1983"},{"key":"10.1016\/0304-3975(92)90380-X_BIB31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/BFb0028829","article-title":"Enumerative combinatorics and algebraic languages","volume":"Vol. 199","author":"Viennot","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290380X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290380X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:58:04Z","timestamp":1555113484000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290380X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["030439759290380X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90380-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}