{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:28:49Z","timestamp":1768285729314,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0020-0190(92)90135-i","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"127-132","source":"Crossref","is-referenced-by-count":1,"title":["Which finite monoids are syntactic monoids of rational \u03c9-languages"],"prefix":"10.1016","volume":"42","author":[{"given":"Phan Trung","family":"Huy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Livotsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Do Long","family":"Van","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90135-I_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","article-title":"A syntactic congruence for rational \u03c9-languages","volume":"39","author":"Arnold","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90135-I_BIB2","volume":"Vol. B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/0020-0190(92)90135-I_BIB3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01008047","article-title":"On \u03c9-languages whose syntactic monoid is trivial","volume":"12","author":"J\u00fcrgensen","year":"1983","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0020-0190(92)90135-I_BIB4","first-page":"513","article-title":"Which monoids are syntactic monoids of \u03c9-languages?","volume":"22","author":"J\u00fcrgensen","year":"1986","journal-title":"Electron. Inf. Kybern."},{"key":"10.1016\/0020-0190(92)90135-I_BIB5","article-title":"Mots infinis","author":"Perrin","year":"1991","journal-title":"Rapport LITP 91.06"},{"key":"10.1016\/0020-0190(92)90135-I_BIB6","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","article-title":"Finite-state \u03c9-languages","volume":"27","author":"Staiger","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(92)90135-I_BIB7","unstructured":"L. Staiger, Syntactic congruence for \u03c9-languages, Private communication."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290135I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290135I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:28Z","timestamp":1555144048000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290135I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290135I"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90135-i","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}