{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:56Z","timestamp":1725662876508},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540088608"},{"type":"electronic","value":"9783540358077"}],"license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08860-1_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:34:44Z","timestamp":1330169684000},"page":"26-35","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sur l'inversion des morphismes d'arbres"],"prefix":"10.1007","author":[{"given":"A.","family":"Arnold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Dauchet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0022-0000(76)80032-3","volume":"13","author":"A. Arnold","year":"1976","unstructured":"A. ARNOLD et M. DAUCHET, \"Un th\u00e9or\u00e8me de duplication pour les for\u00eats alg\u00e9briques\". J. Comput. System Sci. 13 (1976) 223\u2013244.","journal-title":"J. Comput. System Sci."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1051\/ita\/197610R100051","volume":"10","author":"A. Arnold","year":"1976","unstructured":"A. ARNOLD et M. DAUCHET, \"Transductions de for\u00eats reconnaissables monadiques. For\u00eats cor\u00e9guli\u00e8res\". R.A.T.R.O. Informatique th\u00e9orique 10 (1976) 5\u201328.","journal-title":"R.A.T.R.O. Informatique th\u00e9orique"},{"key":"3_CR3","unstructured":"A. ARNOLD et M. DAUCHET, \"Transductions inversibles de for\u00eats\". Th\u00e8se 3o cycle M. DAUCHET, Universit\u00e9 de Lille I (1975)."},{"key":"3_CR4","unstructured":"A. ARNOLD et M. DAUCHET, \"Bitransductions de for\u00eats\" 3rd Automata Languages and Programming, Edinburg (1976) 74\u201386."},{"key":"3_CR5","unstructured":"A. ARNOLD et M. DAUCHET, \"Une \u00e9quivalence d\u00e9cidable sur les for\u00eats r\u00e9guli\u00e8res\". A para\u00eetre dans Math. Systems Theory."},{"key":"3_CR6","unstructured":"A. ARNOLD et M. DAUCHET, \"Un th\u00e9or\u00e8me de Chomsky-Schutzenberger pour les for\u00eats alg\u00e9briques\". A para\u00eetre dans Calcolo."},{"key":"3_CR7","unstructured":"A. ARNOLD et M. DAUCHET, \"For\u00eats alg\u00e9briques et homomorphismes inverses\". A para\u00eetre dans \"Information and Control\"."},{"key":"3_CR8","unstructured":"A. ARNOLD et M. DAUCHET, \"Th\u00e9orie des Magmo\u00efdes\". Publication du Laboratoire de Calcul de l'Universit\u00e9 de Lille I (1977)."},{"key":"3_CR9","unstructured":"A. ARNOLD et M. DAUCHET, \"Morphismes et bimorphismes d'arbres\". A para\u00eetre dans Theoretical Computer Sciences."},{"key":"3_CR10","unstructured":"A. ARNOLD, M. DAUCHET et G. JACOB (\u00e9diteurs), \"1er colloque sur les arbres en alg\u00e8bre et en programmation\". Lille I, (1976)."},{"key":"3_CR11","unstructured":"A. ARNOLD, M. DAUCHET et G. JACOB (\u00e9diteurs), \"2\u00e8me colloque sur les arbres en alg\u00e8bre et en programmation\". Lille I, (1977)."},{"key":"3_CR12","unstructured":"A. ARNOLD, \"Syst\u00e8mes d'\u00e9quations dans le magmo\u00efde. Ensembles rationnels et alg\u00e9briques d'arbres\". Th\u00e8se de Doctorat d'Etat, Lille I (1977)."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"J.M. AUTEBERT et J. BEAUQUIER, \"Une caract\u00e9risation des g\u00e9n\u00e9rateurs standard\", R.A.I.R.O. Informatique th\u00e9orique (1974) 63\u201383.","DOI":"10.1051\/ita\/197408R100631"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"B.S. BAKER, \"Tree-transductions and families of tree-languages\". 5th A.C.M. Proc. on Theory of Computing (1973) 200\u2013206.","DOI":"10.1145\/800125.804051"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"L. BOASSON, \"On the largest (full) sub-AFL of the context-free languages\". Math. Foundations of Computer Science (1975), 194\u2013198.","DOI":"10.1007\/3-540-07389-2_195"},{"key":"3_CR16","first-page":"180","volume":"2","author":"L. Boasson","year":"1973","unstructured":"L. BOASSON et M. NIVAT, \"Sur diverses familles de langages ferm\u00e9es par transduction rationnelle\". Acta Informatica, 2 (1973) 180\u2013188.","journal-title":"Acta Informatica"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W. S. Brainerd","year":"1969","unstructured":"W.S. BRAINERD, \"Tree-generating regular systems\". Inf. and Control 14 (1969) 217\u2013231.","journal-title":"Inf. and Control"},{"key":"3_CR18","unstructured":"M. DAUCHET, \"Transductions de for\u00eats. Bimorphismes de magmo\u00efdes\". Th\u00e8se de Doctorat d'Etat, Lille I (1977)."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BF01704020","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"J. ENGELFRIET, \"Bottom-up and top-down tree transformations. A comparison\". Math. System Theory 9 (1975) 198\u2013231.","journal-title":"Math. System Theory"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"M.J. FISCHER, \"Grammars with macro-like productions\". 9th IEEE Symp. on switching and automata theory (1968) 131\u2013142.","DOI":"10.1109\/SWAT.1968.12"},{"key":"3_CR21","first-page":"285","volume":"113","author":"S. Ginsburg","year":"1966","unstructured":"S. GINSBURG et S. GREIBACH, \"Studies in abstract families of languages\". Memoirs of the Amer. Math. Soc. 113 (1966) 285\u2013296.","journal-title":"Memoirs of the Amer. Math. Soc."},{"key":"3_CR22","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(70)80016-2","volume":"4","author":"S. Ginsburg","year":"1970","unstructured":"S. GINSBURG et S. GREIBACH, \"Principal AFL\" Journ. of Computer and System Sciences 4 (1970) 308\u2013338.","journal-title":"Journ. of Computer and System Sciences"},{"key":"3_CR23","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1051\/ita\/1977110100291","volume":"11\u20131","author":"M. Latteux","year":"1977","unstructured":"M. LATTEUX, \"C\u00f4nes rationnels commutativement clos\". R.A.I.R.O. Informatique th\u00e9orique 11\u20131 (1977) 29\u201351.","journal-title":"R.A.I.R.O. Informatique th\u00e9orique"},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M. Nivat","year":"1968","unstructured":"M. NIVAT, \"Transductions des langages de Chomsky\". Annales de l'Institut Fourier de Grenoble 18 (1968) 339\u2013456.","journal-title":"Annales de l'Institut Fourier de Grenoble"},{"key":"3_CR25","unstructured":"M. NIVAT, \"On the interpretation of recursive program schemas\". Rapport IRIA no 84 (1974)."},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"W.F. OGDEN et W.C. ROUNDS, \"Composing of n tree transducers\". 4th ACM Proc. on theory of computing (1972) 198\u2013206.","DOI":"10.1145\/800152.804915"},{"key":"3_CR27","unstructured":"W.C. ROUNDS, \"Trees, transducers and transformations\". Ph. D. Dissertation, Stanford University (1968)."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"W.C. ROUNDS, \"Context-free grammars on trees\". 1st ACM Proc. on theory of computing (1969) 143\u2013148.","DOI":"10.1145\/800169.805428"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"W.C. ROUNDS, \"Tree-oriented proofs of some theorems on context-free and indexed languages\". 2nd ACM Proc. on theory of computing (1970) 109\u2013116.","DOI":"10.1145\/800161.805156"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W. C. Rounds","year":"1970","unstructured":"W.C. ROUNDS, \"Mappings and grammars on trees\". Math. Systems Theory 4 (1970) 257\u2013287.","journal-title":"Math. Systems Theory"},{"key":"3_CR31","unstructured":"M. TAKAHASHI, \"Primitive transformations of regular sets and recognizable sets\". In \"Automata, Languages and Programming\" (Nivat, Ed.)."},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"M. TAKAHASHI, \"Rational retations of binary trees\". 4rd Automata, Languages and Programming, Turku (1977).","DOI":"10.1007\/3-540-08342-1_41"},{"key":"3_CR33","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","volume":"4","author":"J. W. Thatcher","year":"1970","unstructured":"J.W. THATCHER, \"Generalized2 sequential machine maps\". J. Comput. System Sci. 4 (1970) 339\u2013367.","journal-title":"J. Comput. System Sci."},{"key":"3_CR34","unstructured":"J.W. THATCHER, \"Tree automata: an informat survey\". In \"currents in the theory of computing\" (A.V. Aho, Ed.) Prentice Hall (1973) 143\u2013178."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08860-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:33:41Z","timestamp":1558254821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08860-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540088608","9783540358077"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-08860-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}