{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:03:26Z","timestamp":1725480206076},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405054"},{"type":"electronic","value":"9783540450665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_12","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T12:41:13Z","timestamp":1172666473000},"page":"155-167","source":"Crossref","is-referenced-by-count":3,"title":["On Infinitary Rational Relations and Borel Sets"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Finkel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"12_CR1","volume-title":"Finite Automata, Behaviour and Synthesis","author":"Y. M. Barzdin","year":"1970","unstructured":"Ya M. Barzdin and B.A. Trakhtenbrot, Finite Automata, Behaviour and Synthesis, Nauka, Moscow, 1970 (English translation, North Holland, Amsterdam, 1973)."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(01)00214-6","volume":"292","author":"M.-P. B\u00e9al","year":"2003","unstructured":"M.-P. B\u00e9al, O. Carton, C. Prieur, and J. Sakarovitch, Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality, Theoretical Computer Science, vol. 292, no. 1, pp. 45\u201363, 2003.","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"J. Berstel, Transductions and Context Free Languages, Teubner Verlag, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"12_CR4","unstructured":"B\u00fcc62. J.R. B\u00fcchi, On a Decision Method in Restricted Second Order Arithmetic, Logic Methodology and Philosophy of Science, (Proc. 1960 Int. Congr.), Stanford University Press, 1962, 1\u201311."},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/3-540-45793-3_22","volume-title":"proceedings of CSL 2002","author":"T. Cachat","year":"2002","unstructured":"T. Cachat, J. Duparc, and W. Thomas, Solving Pushdown Games with a \u03a3 3 Winning Condition, proceedings of CSL 2002, LNCS 2471, pp. 322\u2013336"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(77)90049-4","volume":"5","author":"C. Choffrut","year":"1977","unstructured":"C. Choffrut, Une Caract\u00e9risation des Fonctions S\u00e9quentielles et des Fonctions Sous-S\u00e9quentielles en tant que Relations Rationnelles, Theoretical Computer Science, Volume 5, 1977, p.325\u2013338.","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"C. Choffrut and S. Grigorieff, Uniformization of Rational Relations, Jewels are Forever 1999, J. Karhum\u00e4ki, H. Maurer, G. Paun, and G. Rozenberg editors, Springer, p.59\u201371.","DOI":"10.1007\/978-3-642-60207-8_6"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(93)90349-X","volume":"110","author":"J. Engelfriet","year":"1993","unstructured":"J. Engelfriet and H. J. Hoogeboom, X-automata on \u03c9-Words, Theoretical Computer Science 110 (1993) 1, 1\u201351.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"12_CR9","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/S0304-3975(00)00405-9","volume":"262","author":"O. Finkel","year":"2001","unstructured":"O. Finkel, Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Vol 262(1\u20132), July 2001, p. 669\u2013697.","journal-title":"Theoretical Computer Science"},{"key":"12_CR10","unstructured":"O. Finkel, On the Topological Complexity of Infinitary Rational Relations, RAIRO-Theoretical Informatics and Applications, to appear."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"C. Frougny and J. Sakarovitch, Synchronized Rational Relations of Finite and Infinite Words, Theoretical Computer Science 108 (1993) 1, p.45\u201382.","journal-title":"Theoretical Computer Science"},{"key":"12_CR12","unstructured":"F. Gire, Relations Rationnelles Infinitaires, Th\u00e8se de troisi\u00e8me cycle, Universit\u00e9 Paris 7, Septembre 1981."},{"key":"12_CR13","series-title":"Lect Notes Comput Sci","first-page":"123","volume-title":"6th GI Conf.","author":"F. Gire","year":"1983","unstructured":"F. Gire, Une Extension aux Mots Infinis de la Notion de Transduction Rationnelle, 6th GI Conf., Lect. Notes in Comp. Sci., Volume 145, 1983, p. 123\u2013139."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02575909","volume":"XXI","author":"F. Gire","year":"1984","unstructured":"F. Gire and M. Nivat, Relations Rationnelles Infinitaires, Calcolo, Volume XXI, 1984, p. 91\u2013125.","journal-title":"Calcolo"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"A.S. Kechris, Classical Descriptive Set Theory, Springer-Verlag, 1995.","DOI":"10.1007\/978-1-4612-4190-4"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","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) 4, 376\u2013384.","journal-title":"Math. Syst. Theory"},{"key":"12_CR17","series-title":"Lect Notes Comput Sci","first-page":"583","volume-title":"A Decade of Concurrency","author":"H. Lescow","year":"1994","unstructured":"H. Lescow and W. Thomas, Logical Specifications of Infinite Computations, In: \u201cA Decade of Concurrency\u201d (J. W. de Bakker et al., eds), Springer LNCS 803 (1994), 583\u2013621."},{"key":"12_CR18","doi-asserted-by":"crossref","DOI":"10.1515\/9783112546369","volume-title":"Algebraische Codierungstheorie-Theorie der Sequentiellen Codierungen","author":"R. Lindner","year":"1977","unstructured":"R. Lindner and L. Staiger, Algebraische Codierungstheorie-Theorie der Sequentiellen Codierungen, Akademie-Verlag, Berlin, 1977."},{"key":"12_CR19","volume-title":"Descriptive Set Theory","author":"Y. N. Moschovakis","year":"1980","unstructured":"Y. N. Moschovakis, Descriptive Set Theory, North-Holland, Amsterdam 1980."},{"key":"12_CR20","unstructured":"D. Perrin and J.-E. Pin, Infinite Words, Book in preparation, available from http:\/\/www.liafa.jussieu.fr\/jep\/InfiniteWords.html ."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02127803","volume":"16","author":"J.-E. Pin","year":"1996","unstructured":"J.-E. Pin, Logic, Semigroups and Automata on Words, Annals of Mathematics and Artificial Intelligence 16 (1996), p. 343\u2013384.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"12_CR22","unstructured":"C. Prieur, Fonctions Rationnelles de Mots Infinis et Continuit\u00e9, Th\u00e8se de Doctorat, Universit\u00e9 Paris 7, Octobre 2000."},{"key":"12_CR23","unstructured":"P. Simonnet, Automates et Th\u00e9orie Descriptive, Ph.D. Thesis, Universit\u00e9 Paris 7, March 1992."},{"issue":"5\/6","key":"12_CR24","first-page":"219","volume":"22","author":"L. Staiger","year":"1986","unstructured":"L. Staiger, Hierarchies of Recursive \u03c9-Languages, Jour. Inform. Process. Cybernetics EIK 22 (1986) 5\/6, 219\u2013241.","journal-title":"Jour. Inform. Process. Cybernetics EIK"},{"key":"12_CR25","unstructured":"L. Staiger, \u03c9-Languages, Chapter of the Handbook of Formal languages, Vol 3, edited by G. Rozenberg and A. Salomaa, Springer-Verlag, Berlin."},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1002\/malq.19780243107","volume":"24","author":"L. Staiger","year":"1978","unstructured":"L. Staiger and K. Wagner, Rekursive Folgenmengen I, Z. Math Logik Grundlag. Math. 24, 1978, 523\u2013538.","journal-title":"Z. Math Logik Grundlag. Math."},{"key":"12_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/BFb0013115","volume-title":"Formal Properties of Finite automata and Applications, Ramatuelle, 1988","author":"W. Thomas","year":"1989","unstructured":"W. Thomas, Automata and Quantifier Hierarchies, in: Formal Properties of Finite automata and Applications, Ramatuelle, 1988, Lecture Notes in Computer Science 386, Springer, Berlin, 1989, p.104\u2013119."},{"key":"12_CR28","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"W. Thomas, Automata on Infinite Objects, in: J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990), p. 133\u2013191."}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T20:18:09Z","timestamp":1683749889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}