{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:55:35Z","timestamp":1676472935180},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"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":9177,"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":[[1988,6]]},"DOI":"10.1016\/0304-3975(88)90020-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"81-101","source":"Crossref","is-referenced-by-count":4,"title":["Counting with rational functions"],"prefix":"10.1016","volume":"58","author":[{"given":"C.","family":"Choffrut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.P.","family":"Schutzenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90020-5_BIB1","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(88)90020-5_BIB2","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(88)90020-5_BIB3","series-title":"Les S\u00e9ries Rationelles et leurs Langages","author":"Berstel","year":"1984"},{"key":"10.1016\/0304-3975(88)90020-5_BIB4","series-title":"Proc. 6th ICALP","first-page":"88","article-title":"A generalization of Ginsburg and Rose's characterization of g-sm mappings","author":"Choffrut","year":"1979"},{"key":"10.1016\/0304-3975(88)90020-5_BIB5","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(88)90020-5_BIB6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.4153\/CJM-1966-040-3","article-title":"A characterization of machine mappings","volume":"18","author":"Ginsburg","year":"1966","journal-title":"Canad. J. Math."},{"key":"10.1016\/0304-3975(88)90020-5_BIB7","series-title":"Ph.D. Thesis","article-title":"Formal models for string similarity","author":"Johnson","year":"1983"},{"key":"10.1016\/0304-3975(88)90020-5_BIB8","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(88)90020-5_BIB9","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/0304-3975(88)90020-5_BIB10","first-page":"128","article-title":"A combinatorial problem in the theory of free monoids","author":"Lentin","year":"1967","journal-title":"Proc. Conf. held at the University of North-Carolina at Chapel Hill"},{"key":"10.1016\/0304-3975(88)90020-5_BIB11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation am=bncp in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"key":"10.1016\/0304-3975(88)90020-5_BIB12","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","article-title":"Transductions des langages de Chomsky","volume":"18","author":"Nivat","year":"1968","journal-title":"Ann. Inst. Fourier"},{"key":"10.1016\/0304-3975(88)90020-5_BIB13","doi-asserted-by":"crossref","first-page":"885","DOI":"10.2307\/2034080","article-title":"On a theorem of R. Jungen","volume":"13","author":"Sch\u00fctzenberger","year":"1962","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(88)90020-5_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(77)90055-X","article-title":"Sur une variante des fonctions s\u00e9quentielles","volume":"4","author":"Sch\u00fctzenberger","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:52:20Z","timestamp":1621032740000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588900205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0304397588900205"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90020-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}