{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:54:11Z","timestamp":1676472851024},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"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":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00180-q","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"229-240","source":"Crossref","is-referenced-by-count":7,"title":["Vari\u00e9t\u00e9s et fonctions rationnelles"],"prefix":"10.1016","volume":"145","author":[{"given":"Christophe","family":"Reutenauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel Paul","family":"Sch\u00fctzenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00180-Q_BIB1","series-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB2","series-title":"\u00c9cole de Printemps d'lnformatique Th\u00e9orique","article-title":"Fonctions rationnelles et addition","author":"Berstel","year":"1981"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB3","article-title":"Contribution \u00e0 l'\u00e9tude de quelques familles remarquables de fonctions rationnelles","author":"Choffrut","year":"1978"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB4","first-page":"88","article-title":"A generalization of Ginsburg and Rose's characterization of g-s-m mappings","volume":"Vol. 71","author":"Choffrut","year":"1979"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB5","first-page":"213","article-title":"D\u00e9composition des fonctions rationnelles","volume":"Vol. 210","author":"Choffrut","year":"1986"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB6","series-title":"L'\u00c9cole Normale de l'An Ill, Le\u00e7ons de Math\u00e9matiques","author":"Dhombres","year":"1992"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB7","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB8","volume":"Vol. B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01368783","article-title":"Representation of numbers and finite automata","volume":"25","author":"Frougny","year":"1992","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB10","series-title":"Vari\u00e9t\u00e9s de Langages Formels","author":"Pin","year":"1984"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0304-3975(85)90019-2","article-title":"Une application de la repr\u00e9sentation matricielle des transductions","volume":"35","author":"Pin","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00180-Q_BIB12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0021-8693(91)90094-O","article-title":"Topologies for the free monoid","volume":"137","author":"Pin","year":"1991","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB13","first-page":"62","article-title":"Subsequential functions: characterizations, minimization, examples","volume":"Vol. 464","author":"Reutenauer","year":"1990"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB14","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/0220042","article-title":"Minimization of rational word functions","volume":"20","author":"Reutenauer","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00180-Q_BIB15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1112\/blms\/25.1.37","article-title":"On the profinite completion on a free group","volume":"25","author":"Ribes","year":"1993","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/0304-3975(94)00180-Q_BIB16","series-title":"Actes du Colloque \u201cCodages et Transductions\u201d","first-page":"285","article-title":"Sur la d\u00e9finition du produit en couronne","author":"Sakarovitch","year":"1979"},{"key":"10.1016\/0304-3975(94)00180-Q_BIB17","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":"Sch\u00fctzenberger","year":"1976","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400180Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400180Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:28:54Z","timestamp":1556299734000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400180Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400180Q"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00180-q","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}