{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:55:40Z","timestamp":1768258540994,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":[[1993,7]]},"DOI":"10.1016\/0020-0190(93)90069-l","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T14:05:40Z","timestamp":1034085940000},"page":"301-308","source":"Crossref","is-referenced-by-count":18,"title":["A unified approach for showing language inclusion and equivalence between various types of \u03c9-automata"],"prefix":"10.1016","volume":"46","author":[{"given":"E.M.","family":"Clarke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.A.","family":"Draghicescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.P.","family":"Kurshan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90069-L_BIB1","series-title":"Tech. Rept. I-8632","article-title":"A linear algorithm to solve fixed-point equations on graphs","author":"Arnold","year":"1986"},{"key":"10.1016\/0020-0190(93)90069-L_BIB2","series-title":"Proc. Internat. Congres on Logic Method and Philosophy of Science","first-page":"1","article-title":"On a decision method in resticted secon-order arithmetics","author":"B\u00fcchi","year":"1960-1962"},{"key":"10.1016\/0020-0190(93)90069-L_BIB3","series-title":"Proc. STACS86","article-title":"Temporal reasoning under generalized fairness constraints","volume":"210","author":"Emerson","year":"1986"},{"key":"10.1016\/0020-0190(93)90069-L_BIB4","series-title":"Tech. Rept. 1121-861010-33-TM","article-title":"Testing containment of \u03c9-regular languages","author":"Kurshan","year":"1986"},{"key":"10.1016\/0020-0190(93)90069-L_BIB5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0022-0000(87)90036-5","article-title":"Complementing deterministic B\u00fcchi automata in polynomial time","volume":"35","author":"Kurshan","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(93)90069-L_BIB6","series-title":"Proc. 14th Ann. ACM Symp. on Principles of Programming Languages, 1987","first-page":"1","article-title":"Specification and verification of concurrent programs by \u03b1-automata","author":"Manna","year":"1987"},{"key":"10.1016\/0020-0190(93)90069-L_BIB7","series-title":"Proc. Fourth Ann Symp. on Switching Cicuit Theory and Logical Design","first-page":"3","article-title":"Infinite sequences and finite machines","author":"Muller","year":"1963"},{"key":"10.1016\/0020-0190(93)90069-L_BIB8","series-title":"Tech. Rept. 81-64","article-title":"Behaviours of synchronized systems of processes","author":"Nivat","year":"1981"},{"issue":"1","key":"10.1016\/0020-0190(93)90069-L_BIB9","doi-asserted-by":"crossref","DOI":"10.1016\/0890-5401(89)90046-1","article-title":"Automata on infinite objects and their applications to logic and programming","volume":"83","author":"Nivat","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(93)90069-L_BIB10","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(93)90069-L_BIB11","article-title":"On the complexity of \u03c9-automata","author":"Safra","year":"1988","journal-title":"Proc. IEEE Symp. on Foundations of Computer Science"},{"issue":"2","key":"10.1016\/0020-0190(93)90069-L_BIB12","first-page":"733","article-title":"Complexity of propositional temporal logics","volume":"32","author":"Sistla","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90069-L_BIB13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","article-title":"Propositional dynamic logic of looping and converse is elementary decidable","volume":"54","author":"Streett","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(93)90069-L_BIB14","series-title":"Proc. Conf. on Logic in Computer Science","article-title":"An automata-theoretic approach to automatic program verification","author":"Vardi","year":"1986"},{"key":"10.1016\/0020-0190(93)90069-L_BIB15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","article-title":"Temporal logic can be more expressive","volume":"56","author":"Wolper","year":"1983","journal-title":"Inform. and Control"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390069L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390069L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:23:32Z","timestamp":1554906212000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390069L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390069L"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90069-l","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}