{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:36:08Z","timestamp":1768257368510,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","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(95)80022-2","type":"journal-article","created":{"date-parts":[[2002,11,12]],"date-time":"2002-11-12T12:32:32Z","timestamp":1037104352000},"page":"1-21","source":"Crossref","is-referenced-by-count":2,"title":["Characterizations of rational \u03c9-languages by means of right congruences"],"prefix":"10.1016","volume":"143","author":[{"family":"Do Long Van","sequence":"first","affiliation":[]},{"given":"Bertrand","family":"Le Sa\u00ebc","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Litovsky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)80022-2_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\/0304-3975(95)80022-2_BIB2","article-title":"On a decision method in restricted second order arithmetic logic","author":"B\u00fccni","year":"1962"},{"key":"10.1016\/0304-3975(95)80022-2_BIB3","series-title":"Th\u00e9orie des Automates et Applications, Actes des Deuxi\u00e8mes Journ\u00e9es","first-page":"133","article-title":"A syntactic approach to deterministic \u03c9-automata","author":"Do Long Van","year":"1991"},{"key":"10.1016\/0304-3975(95)80022-2_BIB4_1","volume":"Vol. 3A and B","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(95)80022-2_BIB4_2","volume":"Vol. 3A and B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/0304-3975(95)80022-2_BIB5","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","article-title":"Decisions problems for \u03c9-automata","volume":"3","author":"Landweber","year":"1969","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)80022-2_BIB6","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1051\/ita\/1990240605451","article-title":"Saturating right congruences for rational \u03c9-languages","volume":"24","author":"Le Sa\u00ebc","year":"1990","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"issue":"3","key":"10.1016\/0304-3975(95)80022-2_BIB7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1142\/S0218196791000195","article-title":"Finite semigroups with idempotent stabilizers and applications to automata theory","volume":"1","author":"Le Sa\u00ebc","year":"1991","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/0304-3975(95)80022-2_BIB8","series-title":"STACS'93","article-title":"On syntactic congruences for \u03c9-languages","volume":"Vol. 665","author":"Maler","year":"1993"},{"key":"10.1016\/0304-3975(95)80022-2_BIB9","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by finite automaton","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)80022-2_BIB10","first-page":"3","article-title":"Infinite sequences and finite machines","author":"M\u00fcller","year":"1963"},{"key":"10.1016\/0304-3975(95)80022-2_BIB11","first-page":"2","article-title":"An introduction to finite automata on infinite words","volume":"Vol. 192","author":"Perrin","year":"1984"},{"key":"10.1016\/0304-3975(95)80022-2_BIB12","article-title":"Mots infinis","author":"Perrin","year":"1993"},{"key":"10.1016\/0304-3975(95)80022-2_BIB13","first-page":"24","article-title":"On the complexity of \u03c9-automata","author":"Safta","year":"1988"},{"key":"10.1016\/0304-3975(95)80022-2_BIB14","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."},{"issue":"7","key":"10.1016\/0304-3975(95)80022-2_BIB15","first-page":"379","article-title":"Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regularer Folgenmengen","volume":"10","author":"Staiger","year":"1974","journal-title":"Elektron. Informationscerab. Kybernetik EIK"},{"key":"10.1016\/0304-3975(95)80022-2_BIB16","article-title":"The three subfamilies of rational \u03c9-languages closed under \u03c9-transduction","volume":"76","author":"Timermann","year":"1990","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0304-3975(95)80022-2_BIB17","first-page":"103","article-title":"Finite automata and the logic of one-place predicates","volume":"3","author":"Trachenbrot","year":"1962","journal-title":"Siberian Math. J."},{"key":"10.1016\/0304-3975(95)80022-2_BIB18","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","article-title":"On \u03c9-regular sets","volume":"43","author":"Wagner","year":"1979","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800222?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800222?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T12:56:48Z","timestamp":1554209808000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595800222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0304397595800222"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)80022-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}