{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:11:17Z","timestamp":1767237077053},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00271-7","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"225-251","source":"Crossref","is-referenced-by-count":17,"title":["Determinization of transducers over finite and infinite words"],"prefix":"10.1016","volume":"289","author":[{"given":"Marie-Pierre","family":"B\u00e9al","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Carton","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00271-7_BIB1","unstructured":"M.-P. B\u00e9al, Codage Symbolique, Masson, 1993."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB2","doi-asserted-by":"crossref","unstructured":"M.-P. B\u00e9al, O. Carton, Computing the prefix of an automaton, Tech. Rep. 2000-08, Institut Gaspard Monge, 2000.","DOI":"10.1051\/ita:2000127"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB3","series-title":"ICALP\u20192000","first-page":"561","article-title":"Determinization of transducers over infinite words","volume":"Vol. 1853","author":"B\u00e9al","year":"2000"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB4","series-title":"LATIN\u20192000","first-page":"397","article-title":"Squaring transducers: an efficient procedure for deciding functionality and sequentiality","volume":"Vol. 1776","author":"B\u00e9al","year":"2000"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB5","doi-asserted-by":"crossref","unstructured":"J. Berstel, Transductions and Context-Free Languages, B.G. Teubner, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB6","unstructured":"J. Berstel, D. Perrin, Finite and infinite words, in: M. Lothaire (Ed.), Algebraic Combinatorics on Words, Cambridge, 1999, to appear."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB7","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/S0022-0000(77)80033-0","article-title":"Singled valued a-transducers","volume":"15","author":"Blattner","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB8","doi-asserted-by":"crossref","unstructured":"D. Breslauer, The suffix tree of a tree and minimizing sequential transducers, in: CPM\u201996, Lecture Notes in Computer Science, Vol. 1075, Springer, Berlin, 1996, pp. 116\u2013129.","DOI":"10.1007\/3-540-61258-0_10"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0304-3975(96)00319-2","article-title":"The suffix tree of a tree and minimizing sequential transducers","volume":"191","author":"Breslauer","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB10","unstructured":"O. Carton, C. Choffrut, C. Prieur, How to decide functionality of rational relations on infinite words, Preprint."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(77)90049-4","article-title":"Une caract\u00e9risation des fonctions s\u00e9quentielles et des fonctions sous-s\u00e9quentielles en tant que relations rationnelles","volume":"5","author":"Choffrut","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB12","unstructured":"C. Choffrut, Contribution \u00e0 l\u2019\u00e9tude de quelques familles remarquables de fonctions rationnelles, Th\u00e8se d\u2019\u00c9tat Universit\u00e9 Paris VII, 1978."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB13","doi-asserted-by":"crossref","unstructured":"C. Choffrut, A generalization of Ginsburg and Rose's characterization of gsm mappings, in: ICALP\u201979 Lecture Notes in Computer Science, Vol. 71, Springer, Berlin, 1979, pp. 88\u2013103.","DOI":"10.1007\/3-540-09510-1_8"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB14","doi-asserted-by":"crossref","unstructured":"A. Cohen, J.-F. Collard, Instance-wise reaching definition analysis for recursive programs using context-free transductions, in: PACT\u201998, 1998.","DOI":"10.1109\/PACT.1998.727269"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB15","series-title":"Automata, Languages and Machines, Vol. A","author":"Eilenberg","year":"1972"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB16","unstructured":"C. Frougny, Numeration systems, in: M. Lothaire (Ed.), Algebraic Combinatorics on Words, Cambridge, 1999, to appear."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(86)90058-X","article-title":"Two decidability problems for infinite words","volume":"22","author":"Gire","year":"1986","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB18","unstructured":"B. Kitchens, Continuity properties of factor maps in ergodic theory, Ph.D. Thesis, University of North Carolina, Chapel Hill, 1981."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB19","series-title":"An Introduction to Symbolic Dynamics and Coding","author":"Lind","year":"1995"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB20","series-title":"CPM\u201994","first-page":"151","article-title":"Minimization of sequential transducers","volume":"Vol. 807","author":"Mohri","year":"1994"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB21","first-page":"1","article-title":"On some applications of finite-state automata theory to natural languages processing","volume":"2","author":"Mohri","year":"1996","journal-title":"J. Natur. Language Eng."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB22","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","article-title":"Minimization algorithms for sequential transducers","volume":"234","author":"Mohri","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0304-3975(99)00115-2","article-title":"How to decide continuity of rational functions on infinite words","volume":"250","author":"Prieur","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB24","doi-asserted-by":"crossref","unstructured":"E. Roche, Y. Schabes, Finite-State Language Processing, MIT Press, Cambridge, 1997 (Chapter 7).","DOI":"10.7551\/mitpress\/3007.001.0001"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB25","doi-asserted-by":"crossref","unstructured":"S. Safra, On the complexity of \u03c9-automata, 29th Ann. Symp. on Foundations of Computer Sciences, 1988, pp. 24\u201329.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB26","series-title":"Automata Theory and Formal Languages, 2nd GI Conference","first-page":"209","article-title":"Sur les relations rationnelles","volume":"Vol. 33","author":"Sch\u00fctenberger","year":"1975"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB27","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(77)90055-X","article-title":"Sur une variante des fonctions s\u00e9quentielles","volume":"11","author":"Sch\u00fctenberger","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00271-7_BIB28","series-title":"Handbook of Theoretical Computer Science, Vol. B","first-page":"133","article-title":"Automata on infinite objects","author":"Thomas","year":"1990"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB29","doi-asserted-by":"crossref","unstructured":"A. Weber, R. Klemm, Economy of description for single-valued transducers, in: P. Enjalbert, E.W. Mayr, K.W. Wagner (Eds.), STACS\u201994, Lecture Notes in Computer Science, Vol. 775, Springer, Berlin, 1994, pp. 607\u2013618.","DOI":"10.1007\/3-540-57785-8_175"},{"key":"10.1016\/S0304-3975(01)00271-7_BIB30","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1006\/inco.1995.1071","article-title":"Economy of description for single-valued transducers","volume":"118","author":"Weber","year":"1995","journal-title":"Inform. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002717?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002717?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T17:54:43Z","timestamp":1583776483000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501002717"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00271-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}