{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:55:11Z","timestamp":1768272911861,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540590422","type":"print"},{"value":"9783540491750","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_69","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:58:50Z","timestamp":1330257530000},"page":"143-156","source":"Crossref","is-referenced-by-count":14,"title":["Structural complexity of \u03c9-automata"],"prefix":"10.1007","author":[{"given":"Sriram C.","family":"Krishnan","sequence":"first","affiliation":[]},{"given":"Anuj","family":"Puri","sequence":"additional","affiliation":[]},{"given":"Robert K.","family":"Brayton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","unstructured":"O. Carton. Chain Automata. In IFIP 13th World Computer Congress, pages 451\u2013458, August 1994."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"E. S. Chang, Z. Manna, and A. Pnueli. The Safety-Progress Classification. In F. L. Bauer, W. Bauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 143\u2013202, 1993.","DOI":"10.1007\/978-3-642-58041-3_5"},{"issue":"3","key":"13_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","volume":"8","author":"E. A. Emerson","year":"1987","unstructured":"E. A. Emerson and C. L. Lei. Modalities for Model Checking: Branching Time Logic Strikes Back. Science of Computer Programming, 8(3):275\u2013306, June 1987.","journal-title":"Science of Computer Programming"},{"key":"13_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(85)90043-X","volume":"36","author":"M. Kaminski","year":"1985","unstructured":"M. Kaminski. A Classification of \u03c9-regular languages. Theoretical Computer Science, 36:217\u2013229, 1985.","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"S. C. Krishnan, A. Puri, and R. K. Brayton. Deterministic \u03c9-automata vis-a-vis Deterministic Buchi Automata. In Algorithms and Computation, volume 834 of LNCS, pages 378\u2013386. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58325-4_202"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan. Automata-Theoretic Verification of Coordinating Processes. Princeton University Press, 1994. To appear.","DOI":"10.1007\/BFb0033528"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer Verlag, 1992.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"13_CR9","unstructured":"Kenneth L. McMillan. Personal communication, August 1994."},{"key":"13_CR10","volume-title":"PhD thesis","author":"S. Safra","year":"1989","unstructured":"Shmuel Safra. Complexity of Automata on Infinite Objects. PhD thesis, The Weizmann Institute of Science, Rehovot, Israel, March 1989."},{"key":"13_CR11","first-page":"415","volume":"23","author":"L. Staiger","year":"1987","unstructured":"L. Staiger. Research in the theory of \u03c9-languages. Journal of Information Processing and Cybernetics, 23:415\u2013439, 1987.","journal-title":"Journal of Information Processing and Cybernetics"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on Infinite Objects. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 133\u2013191. Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"K. Wagner. On \u03c9-Regular Sets. Information and Control, 43:123\u2013177, 1979.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:25:12Z","timestamp":1605630312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}