{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T07:35:40Z","timestamp":1768289740442,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":8082,"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":[[1991,6]]},"DOI":"10.1016\/0304-3975(91)90283-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"323-335","source":"Crossref","is-referenced-by-count":22,"title":["Hierarchies of weak automata and weak monadic formulas"],"prefix":"10.1016","volume":"83","author":[{"given":"A.W.","family":"Mostowski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90283-8_BIB1","series-title":"The Monadic Second Order Theory of All Countable Ordinals, Decidable Theories II","first-page":"1","article-title":"The monadic second order theory of \u03c91","volume":"328","author":"B\u00fcchi","year":"1973"},{"key":"10.1016\/0304-3975(91)90283-8_BIB2","series-title":"14th Symp. on Theory of Computation","first-page":"60","article-title":"Trees automata and games","author":"Gurewith","year":"1982"},{"key":"10.1016\/0304-3975(91)90283-8_BIB3","series-title":"Computation Theory, Proc. 5th Symp.","first-page":"157","article-title":"Regular expressions for infinite trees and a standard form of automata","volume":"208","author":"Mostowski","year":"1984"},{"key":"10.1016\/0304-3975(91)90283-8_BIB4","first-page":"509","article-title":"Hierarchies of weak monadic formulas for two successor arithmetics","volume":"23","author":"Mostowski","year":"1987","journal-title":"J. Inform. Process. Cybern."},{"key":"10.1016\/0304-3975(91)90283-8_BIB5","series-title":"Proc. ICALP 86","first-page":"275","article-title":"Alternating automata and a weak monadic theory of the tree and its complexity","author":"Muller","year":"1986"},{"key":"10.1016\/0304-3975(91)90283-8_BIB6","unstructured":"D.E. Muller, P.E. Schupp, Alternating automata on infinite objects, determinancy and Rabins theorem (abstract), in: Automata on Infinite Words, Lecture Notes in Computer Science 192 (Springer, Berlin) 100\u2013107."},{"key":"10.1016\/0304-3975(91)90283-8_BIB7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","article-title":"Alternating automata on infinite trees","volume":"54","author":"Muller","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90283-8_BIB8","doi-asserted-by":"crossref","unstructured":"D. Niwi\u0144ski, On fixed point clones, in: L. Kott, ed., Proc. 13th ICALP Lecture Notes in Computer Science 226 (Springer, Berlin) 465\u2013473.","DOI":"10.1007\/3-540-16761-7_96"},{"key":"10.1016\/0304-3975(91)90283-8_BIB9","first-page":"239","article-title":"Decidability and definability in second-order theories","volume":"1","author":"Rabin","year":"1970","journal-title":"Congress Intern. Math."},{"key":"10.1016\/0304-3975(91)90283-8_BIB10","series-title":"Mathematical Logic and Foundations of Set Theory","first-page":"1","article-title":"Weakly definable relations and special automata","author":"Rabin","year":"1972"},{"key":"10.1016\/0304-3975(91)90283-8_BIB11","doi-asserted-by":"crossref","unstructured":"J.W. Thatcher and J.B. Wright, Generalised finite automata theory with an application to a second order logic, Math. Systems Theory 2, 57\u201381.","DOI":"10.1007\/BF01691346"},{"key":"10.1016\/0304-3975(91)90283-8_BIB12","series-title":"Theoretical Computer Sciences Proc.","first-page":"335","article-title":"A hierarchy of sets of infinite trees","volume":"145","author":"Thomas","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591902838?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591902838?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:56:48Z","timestamp":1555063008000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591902838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["0304397591902838"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90283-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}