{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T15:13:08Z","timestamp":1770909188576,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":11186,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1016\/0022-0000(82)90016-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"360-376","source":"Crossref","is-referenced-by-count":206,"title":["Classifying regular events in symbolic logic"],"prefix":"10.1016","volume":"25","author":[{"given":"Wolfgang","family":"Thomas","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90016-2_BIB1","first-page":"33","article-title":"Hierarchies of aperiodic languages","volume":"10","author":"Brzozowski","year":"1976","journal-title":"Rev. franc. automat. informat. recherche op\u00e9rationelle"},{"key":"10.1016\/0022-0000(82)90016-2_BIB2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0022-0000(78)90049-1","article-title":"The Dot-depth hierarchy of star-free languages is infinite","volume":"16","author":"Brzozowski","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(82)90016-2_BIB3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","article-title":"Characterizations of locally testable events","volume":"4","author":"Brzozowski","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0022-0000(82)90016-2_BIB4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","article-title":"Weak second-order arithmetic and finite automata","volume":"6","author":"B\u00fcchi","year":"1960","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/0022-0000(82)90016-2_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(71)80003-X","article-title":"Dot-depth of star-free events","volume":"5","author":"Cohen","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(82)90016-2_BIB6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1307\/mmj\/1028998975","article-title":"Transition graphs and the star-height of regular events","volume":"10","author":"Eggan","year":"1963","journal-title":"Michigan Math. J."},{"key":"10.1016\/0022-0000(82)90016-2_BIB7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","article-title":"An application of games to the completeness problem for formalized theories","volume":"49","author":"Ehrenfeucht","year":"1961","journal-title":"Fund. Math."},{"key":"10.1016\/0022-0000(82)90016-2_BIB8","volume":"Vol. B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/0022-0000(82)90016-2_BIB9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","article-title":"Decision problems of finite automata design and related arithmetics","volume":"98","author":"Elgot","year":"1961","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(82)90016-2_BIB10","series-title":"The Theory of Models","first-page":"132","article-title":"Model-theoretic methods in the study of elementary logic","author":"Hanf","year":"1965"},{"key":"10.1016\/0022-0000(82)90016-2_BIB11","series-title":"Formal Systems and Recursive Functions, Proc. Eighth Logic Coll.","first-page":"47","article-title":"Distributive normal forms in first-order logic","author":"Hintikka","year":"1965"},{"key":"10.1016\/0022-0000(82)90016-2_BIB12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0019-9958(77)90443-0","article-title":"Application of model-theoretic games to discrete linear orders and finite automata","volume":"33","author":"Ladner","year":"1977","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(82)90016-2_BIB13","article-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/0022-0000(82)90016-2_BIB14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01351676","article-title":"The theory of successor with an extra predicate","volume":"237","author":"Thomas","year":"1978","journal-title":"Math. Ann."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900162?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900162?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:26Z","timestamp":1550325026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["0022000082900162"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90016-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}