{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:20:53Z","timestamp":1759335653858},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":4064,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0304-3975(02)00020-8","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T08:03:50Z","timestamp":1034323430000},"page":"351-367","source":"Crossref","is-referenced-by-count":15,"title":["An algebraic characterization of the set of succession rules"],"prefix":"10.1016","volume":"281","author":[{"given":"Luca","family":"Ferrari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisa","family":"Pergola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Rinaldi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00020-8_BIB1","unstructured":"C. Banderier, M. Bousquet-M\u00e9lou, A. Denise, P. Flajolet, D. Gardy, D. Gouyou-Beauchamps, On generating functions of generating trees, Proc. 11th FPSAC, Barcelona, 1999, pp. 40\u201352."},{"key":"10.1016\/S0304-3975(02)00020-8_BIB2","series-title":"Formal Power Series and Algebraic Combinatorics","first-page":"633","article-title":"From rational functions to regular languages","author":"Barcucci","year":"2000"},{"key":"10.1016\/S0304-3975(02)00020-8_BIB3","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1080\/10236199908808200","article-title":"ECO: a methodology for the enumeration of combinatorial objects","volume":"5","author":"Barcucci","year":"1999","journal-title":"J. Difference Equations Appl."},{"key":"10.1016\/S0304-3975(02)00020-8_BIB4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01608782","article-title":"Some combinatorial interpretations of q-analogs of Schr\u00f6der numbers","volume":"3","author":"Barcucci","year":"1999","journal-title":"Ann. Combin."},{"key":"10.1016\/S0304-3975(02)00020-8_BIB5","first-page":"14pp","article-title":"Eco method and hill-free paths","volume":"B46b","author":"Barcucci","year":"2001","journal-title":"Sem. Lotharingien Combin."},{"key":"10.1016\/S0304-3975(02)00020-8_BIB6","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0097-3165(78)90068-7","article-title":"The number of Baxter permutations","volume":"24","author":"Chung","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0304-3975(02)00020-8_BIB7","unstructured":"S. Corteel, Probl\u00e8mes \u00e9num\u00e9ratifs issus de l'Informatique, de la Physique et de la Combinatorie, Ph.D. Thesis, Universit\u00e9 de Paris-Sud, 2000, pp. 6082."},{"key":"10.1016\/S0304-3975(02)00020-8_BIB8","unstructured":"O. Guibert, Combinatoire des permutations \u00e0 motifs exclus en liason avec mots, cartes planaries et tableaux de Young, Th\u00e8se de l'Universit\u00e9 de Bordeaux I, 1996."},{"key":"10.1016\/S0304-3975(02)00020-8_BIB9","series-title":"Formal Power Series and Algebraic Combinatorics","first-page":"719","article-title":"ECO-Approximation of algebraic functions","author":"Pergola","year":"2000"},{"key":"10.1016\/S0304-3975(02)00020-8_BIB10","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/S0304-3975(02)00020-8_BIB11","series-title":"Automata-Theoretic Aspects of Formal Power Weries","author":"Salomaa","year":"1978"},{"key":"10.1016\/S0304-3975(02)00020-8_BIB12","series-title":"The encyclopedia of integer sequences","author":"Sloane","year":"1996"},{"key":"10.1016\/S0304-3975(02)00020-8_BIB13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(94)00067-1","article-title":"Generating trees and the Catalan and Schr\u00f6der numbers","volume":"146","author":"West","year":"1995","journal-title":"Discrete Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000208?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000208?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T10:10:46Z","timestamp":1583921446000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0304397502000208"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00020-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}