{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:37Z","timestamp":1720201057350},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90025-3","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"101-106","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Two characterizations of rational adherences"],"prefix":"10.1016","volume":"46","author":[{"given":"M.","family":"Latteux","sequence":"first","affiliation":[]},{"given":"E.","family":"Timmerman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90025-3_BIB1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","article-title":"Adherences of languages","volume":"20","author":"Boasson","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90025-3_BIB2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0166-218X(82)90072-5","article-title":"A homomorphic characterization of regular languages","volume":"4","author":"Culik","year":"1982","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(86)90025-3_BIB3","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(86)90025-3_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/BF02575909","article-title":"Relations rationnelles infinitaires","author":"Gire","year":"1981"},{"key":"10.1016\/0304-3975(86)90025-3_BIB5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(83)90045-8","article-title":"A note on morphic characterization of languages","volume":"5","author":"Karhum\u00e4ki","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(86)90025-3_BIB6","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/BFb0036926","article-title":"On the composition of morphisms and inverse morphisms","volume":"154","author":"Latteux","year":"1983","journal-title":"Lecture Notes Computer Sciences"},{"key":"10.1016\/0304-3975(86)90025-3_BIB7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by a finite automaton","volume":"9","author":"MacNaughton","year":"1966","journal-title":"Inform. and Control."},{"key":"10.1016\/0304-3975(86)90025-3_BIB8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita\/1978120302591","article-title":"Sur les ensembles de mots infinis engendr\u00e9s par une grammaire alg\u00e9brique","volume":"12","author":"Nivat","year":"1978","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(86)90025-3_BIB9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(78)90050-6","article-title":"Sur le mono\u00efde syntactique de L\u2217 lorsque L est un language fini","volume":"7","author":"Pin","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90025-3_BIB10","article-title":"Mots infinis et processus: Objets infinitaires et topologie","author":"Tison","year":"1983"},{"key":"10.1016\/0304-3975(86)90025-3_BIB11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0255(82)90057-3","article-title":"A homomorphic characterization of principal semi-AFLs without using intersection with regular sets","volume":"27","author":"Turakainen","year":"1982","journal-title":"Inform. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900253?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900253?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:53:45Z","timestamp":1553187225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":11,"alternative-id":["0304397586900253"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90025-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}