{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T18:37:19Z","timestamp":1723487839414},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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":5433,"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":[[1998,9]]},"DOI":"10.1016\/s0304-3975(98)00040-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"205-231","source":"Crossref","is-referenced-by-count":22,"title":["A construction on finite automata that has remained hidden"],"prefix":"10.1016","volume":"204","author":[{"given":"Jacques","family":"Sakarovitch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00040-1_BIB1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(79)90049-5","article-title":"A new proof of two theorems about rational transductions","volume":"8","author":"Arnold","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00040-1_BIB2","series-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB3","volume":"vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","article-title":"On relations defined by generalized finite automata","volume":"9","author":"Elgot","year":"1965","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/S0304-3975(98)00040-1_BIB5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1109\/18.75263","article-title":"Fibonacci representations and finite automata","volume":"37","author":"Frougny","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","article-title":"Synchronized rational relations of finite and infinite words","volume":"108","author":"Frougny","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00040-1_BIB7","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB8","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0019-9958(69)90651-2","article-title":"Classification of formal languages by functional binary transductions","volume":"15","author":"Kobayashi","year":"1969","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB10","first-page":"1","article-title":"Finite Automata","author":"Perrin","year":"1990"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB11","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S0019-9958(61)80006-5","article-title":"A remark on finite transducers","volume":"4","author":"Sch\u00fctzenberger","year":"1961","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB12","series-title":"Proc. Symp. on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn","first-page":"139","article-title":"Certain elementary families of automata","author":"Sch\u00fctzenberger","year":"1962"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB13","first-page":"885","article-title":"On a theorem of R. Jungen","volume":"13","author":"Sch\u00fctzenberger","year":"1962"},{"key":"10.1016\/S0304-3975(98)00040-1_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(76)90026-8","article-title":"Sur les relations rationnelles entre mono\u00efdes libres","volume":"3","author":"Schiitzenberger","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00040-1_BIB15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(77)90055-X","article-title":"Une variante des fonctions s\u00e9quentielles","volume":"4","author":"Sch\u00fctzenberger","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00040-1_BIB16","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02095993","article-title":"Topology of finite graphs","volume":"71","author":"Stallings","year":"1983","journal-title":"Invent. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000401?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000401?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:01:43Z","timestamp":1555405303000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0304397598000401"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00040-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}