{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:26:46Z","timestamp":1767896806226,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,5,1]],"date-time":"1982-05-01T00:00:00Z","timestamp":389059200000},"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":11400,"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":[[1982,5]]},"DOI":"10.1016\/0304-3975(82)90019-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"115-148","source":"Crossref","is-referenced-by-count":105,"title":["Recognizable formal power series on trees"],"prefix":"10.1016","volume":"18","author":[{"given":"J.","family":"Berstel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Reutenauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90019-6_BIB1","article-title":"Syst\u00e8mes d'\u00e9quations dans le magmo\u00efde: Ensembles rationnels et alg\u00e9briques d'arbes","author":"Arnold","year":"1977","journal-title":"Th\u00e8se d'Etat"},{"key":"10.1016\/0304-3975(82)90019-6_BIB2","first-page":"11","article-title":"S\u00e9ries formelles reconnaissables d'arbres et applications","author":"Berstel","year":"1980","journal-title":"5\u00e8me Colloque de Lille: Les Arbres en Alg\u00e8bre et en Programmation"},{"key":"10.1016\/0304-3975(82)90019-6_BIB3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","article-title":"Tree-generating regular systems","volume":"14","author":"Brainerd","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90019-6_BIB4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(75)90019-9","article-title":"Une preuve combinatoire de la formule de Lagrange \u00e0 deux variables","volume":"13","author":"Chottin","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(82)90019-6_BIB5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01768487","article-title":"Representation of a word function as the sum of two functions","volume":"11","author":"Cobham","year":"1978","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90019-6_BIB6","series-title":"Universal Algebra","author":"Cohn","year":"1965"},{"key":"10.1016\/0304-3975(82)90019-6_BIB7","article-title":"Un code pour les graphes planaires et ses applications","volume":"27","author":"Cori","year":"1975","journal-title":"Ast\u00e9rique"},{"key":"10.1016\/0304-3975(82)90019-6_BIB8","article-title":"Transductions de for\u0115ts: Bimorphismes de magmo\u00efdes","author":"Dauchet","year":"1977","journal-title":"Th\u00e8se d'Etat"},{"key":"10.1016\/0304-3975(82)90019-6_BIB9","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(82)90019-6_BIB10","article-title":"Analyse d'algorithmes de manipulation d'arbres et de fichiers","author":"Flajolet","year":"1979","journal-title":"Th\u00e8se d'Etat"},{"key":"10.1016\/0304-3975(82)90019-6_BIB11","unstructured":"P. Flajolet, Private Communication."},{"key":"10.1016\/0304-3975(82)90019-6_BIB12","article-title":"On the analysis of tree-matching algorithms","author":"Flajolet","year":"1980","journal-title":"5\u00e8me Colloque de Lille: Les Arbres en Alg\u00e8bre et en Programmation"},{"key":"10.1016\/0304-3975(82)90019-6_BIB13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0021-8693(80)90080-0","article-title":"Un th\u00e9or\u00e8me de factorisation des produits d'endomorphismes","volume":"63","author":"Jacob","year":"1980","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(82)90019-6_BIB14","series-title":"Proc 6th ICALP","first-page":"340","article-title":"On the average stack size of regularly distributed binary trees","volume":"71","author":"Kemp","year":"1979"},{"key":"10.1016\/0304-3975(82)90019-6_BIB15","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(82)90019-6_BIB16","first-page":"189","article-title":"S-transducteurs de for\u011bts","author":"Lilin","year":"1979","journal-title":"3\u00e8me C.L.A.A.P."},{"key":"10.1016\/0304-3975(82)90019-6_BIB17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0022-0000(78)90012-0","article-title":"Pumping lemmas for term languages","volume":"17","author":"Maibaum","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90019-6_BIB18","first-page":"135","article-title":"Closure of recognizable tree-languages under intersection and morphisms","author":"Mongy","year":"1980","journal-title":"5\u00e8me Colloque de Lille: Les Arbres en Alg\u00e8bres et Programmation"},{"key":"10.1016\/0304-3975(82)90019-6_BIB19","first-page":"255","article-title":"On the interpretation of recursive polyadic program schemes","volume":"15","author":"Nivat","year":"1975","journal-title":"Symposia Math."},{"key":"10.1016\/0304-3975(82)90019-6_BIB20","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0019-9958(73)80002-6","article-title":"Integral sequential word functions and growth equivalence of Lindenmayer systems","volume":"23","author":"Paz","year":"1973","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90019-6_BIB21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00263993","article-title":"An Ogden-like iteration lemma for rational power series","volume":"13","author":"Reutenauer","year":"1980","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90019-6_BIB22","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree-manipulating systems and Church\u2013Rosser theorem","volume":"20","author":"Rosen","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90019-6_BIB23","series-title":"Automata-Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/0304-3975(82)90019-6_BIB24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","article-title":"On the definition of a family of automata","volume":"4","author":"Sch\u00fctzenberger","year":"1961","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90019-6_BIB25","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","article-title":"Characterizing derivation trees of context-free grammars through a generalization of finite automata theory","volume":"1","author":"Thatcher","year":"1967","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90019-6_BIB26","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","article-title":"Generalized sequential machine maps","volume":"4","author":"Thatcher","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90019-6_BIB27","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision problem of second-order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900196?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:26:23Z","timestamp":1555125983000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,5]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,5]]}},"alternative-id":["0304397582900196"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90019-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,5]]}}}