{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:52Z","timestamp":1725456772970},"publisher-location":"Berlin\/Heidelberg","reference-count":23,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029636","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"407-415","source":"Crossref","is-referenced-by-count":2,"title":["Rational \u03c9-transductions"],"prefix":"10.1007","author":[{"given":"M.","family":"Latteux","sequence":"first","affiliation":[]},{"given":"E.","family":"Timmerman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(85)90071-7","volume":"20","author":"D. Beauquier","year":"1985","unstructured":"D. Beauquier and D. Perrin, \"Codeterministic automata on infinite words\", Inform. Process. Letters 20 (1985), pp. 95\u201398.","journal-title":"Inform. Process. Letters"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"J. Berstel, \"Transductions and context-free languages\", Teubner 1979, Stuttgart.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"45_CR3","first-page":"180","volume":"2","author":"L. Boasson","year":"1973","unstructured":"L. Boasson and M. Nivat, \"Sur diverses familles de languages ferm\u00e9es par transduction rationnelle\", Acta Informatica 2 (1973), PP. 180\u2013188.","journal-title":"Acta Informatica"},{"key":"45_CR4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","volume":"20","author":"L. Boasson","year":"1980","unstructured":"L. Boasson and M. Nivat, \"Adherences of languages\", J. Comput. Syst. Sciences 20 (1980), pp. 285\u2013309.","journal-title":"J. Comput. Syst. Sciences"},{"key":"45_CR5","unstructured":"J.R. B\u00fcchi, \"On a decision method in restricted second order arithmetic\", in Proc. 1960 Int.Congr. for Logic, Stanford Univ. Press, pp. 1\u201311."},{"key":"45_CR6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/S0019-9958(81)90444-7","volume":"49","author":"K. Culik II","year":"1981","unstructured":"K. Culik II and J.K. Pachl, \"Equivalence problems for mappings on infinite strings\", Inform. and Control 49 (1981), pp. 52\u201353.","journal-title":"Inform. and Control"},{"key":"45_CR7","volume-title":"\"Automata, Languages and Machines\", vol. A","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg, \"Automata, Languages and Machines\", vol. A, Academic Press, New York, 1974."},{"key":"45_CR8","unstructured":"C Frougny, \"Syst\u00e8mes de num\u00e9ration lin\u00e9aires et automates finis\", Th\u00e8se d'Etat, Paris VII, 1989."},{"key":"45_CR9","unstructured":"F. Gire, \"Relations rationnelles infinitaires\", Th\u00e8se de 3\u00e8me cycle, Paris VII, 1981."},{"key":"45_CR10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BFb0009639","volume":"145","author":"F. Gire","year":"1983","unstructured":"F. Gire, \"Une extension aux mots infinis de la notion de transduction rationnelle\", 6th GI conf. (1983), Lecture Notes in Comput. Sci. 145, pp. 123\u2013139.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"45_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02575909","volume":"21","author":"F. Gire","year":"1984","unstructured":"F. Gire and M. Nivat, \"Relations rationnelles infinitaires\", Calcolo 21 (1984), pp. 91\u2013125.","journal-title":"Calcolo"},{"key":"45_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(83)90045-8","volume":"5","author":"J. Karhum\u00e4ki","year":"1983","unstructured":"J. Karhum\u00e4ki and M. Linna, \"A note on morphic characterization of languages\", Discrete Appl. Math. 5 (1983), pp. 243\u2013246.","journal-title":"Discrete Appl. Math."},{"key":"45_CR13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"L.H. Landweber, \"Decision problems for \u03c9-automata\", Math. Syst. Theory 3 (1969), pp. 376\u2013384.","journal-title":"Math. Syst. Theory"},{"key":"45_CR14","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/BFb0036926","volume":"154","author":"M. Latteux","year":"1983","unstructured":"M. Latteux and J. Leguy, \"On the composition of morphisms and inverse morphisms\", Lecture Notes Comput. Sciences 154 (1983), pp. 420\u2013432.","journal-title":"Lecture Notes Comput. Sciences"},{"key":"45_CR15","first-page":"101","volume":"46","author":"M. Latteux","year":"1986","unstructured":"M. Latteux and E. Timmerman, \"Two characterizations of rational adherences\", T. C. S. 46 (1986), pp. 101\u2013106.","journal-title":"T. C. S."},{"key":"45_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(88)90135-4","volume":"28","author":"M. Latteux","year":"1988","unstructured":"M. Latteux and E. Timmerman, \"Bifaithful starry transductions\", Inform. Process. Letters 28 (1988), PP. 1\u20134.","journal-title":"Inform. Process. Letters"},{"key":"45_CR17","unstructured":"M. Latteux and E. Timmerman, \"Rational \u03c9-transductions\", technical report Univ. Lille 1, LIFL no IT 176 (1990)."},{"key":"45_CR18","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"R. McNaughton, \"Testing and generating infinite sequences by a finite automaton\", Inform. and Control 9 (1966), pp. 521\u2013530.","journal-title":"Inform. and Control"},{"key":"45_CR19","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1051\/ita\/1987210201471","volume":"21","author":"L. Staiger","year":"1987","unstructured":"L. Staiger, \"Sequential mappings of \u03c9-languages\", RAIRO Inf. Theo. et Applic. 21 (1987), pp. 147\u2013173.","journal-title":"RAIRO Inf. Theo. et Applic."},{"key":"45_CR20","first-page":"415","volume":"23","author":"L. Staiger","year":"1987","unstructured":"L. Staiger, \"Research in the theory of \u03c9-languages\", J. Inf. Process. Cybern. EIK 23 (1987) pp. 415\u2013439.","journal-title":"J. Inf. Process. Cybern. EIK"},{"key":"45_CR21","first-page":"217","volume":"23","author":"M. Takahashi","year":"1983","unstructured":"M. Takahashi and H. Yamasaki, \"A note on \u03c9-regular languages\", T. C. S. 23 (1983), pp. 217\u2013225.","journal-title":"T. C. S."},{"key":"45_CR22","doi-asserted-by":"crossref","unstructured":"E. Timmerman, \"The three subfamilies of rational \u03c9-languages closed under \u03c9-transductions\", T. C. S. to appear.","DOI":"10.1016\/0304-3975(90)90018-D"},{"key":"45_CR23","unstructured":"S. Tison, \"Mots infinis et processus. Objets infinitaires et topologie\", Th\u00e8se de 3\u00e8me cycle, Lille 1, 1983."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029636.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:50Z","timestamp":1607551190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0029636","relation":{},"subject":[]}}