{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:30:12Z","timestamp":1648657812339},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"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":[[1990,9]]},"DOI":"10.1016\/0020-0190(90)90029-w","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"287-290","source":"Crossref","is-referenced-by-count":0,"title":["Alternating automata with start formulas"],"prefix":"10.1016","volume":"35","author":[{"given":"A.W.","family":"Mostowski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90029-W_BIB1","first-page":"60","article-title":"Trees automata and games","author":"Gurewith","year":"1982","journal-title":"Proc. 14th Symposium on Theory of Computation of Association for Computing Machinery"},{"key":"10.1016\/0020-0190(90)90029-W_BIB2","article-title":"On the Boolean closure of B\u00fcchi tree automaton definiable sets of \u03c9-trees","author":"Hafer","year":"1987","journal-title":"Aachener Inform. Berichte 87-16"},{"key":"10.1016\/0020-0190(90)90029-W_BIB3","first-page":"157","article-title":"Regular expressions for infinite trees and a standard from of automata","volume":"208","author":"Mostowski","year":"1985"},{"key":"10.1016\/0020-0190(90)90029-W_BIB4","unstructured":"A.W. Mostowski, Hierarchies of weak automata and weak monadic formulas, in preparation."},{"key":"10.1016\/0020-0190(90)90029-W_BIB5","first-page":"275","article-title":"Alternating automata and a weak monadic theory of the tree and its complexity","volume":"226","author":"Muller","year":"1986"},{"key":"10.1016\/0020-0190(90)90029-W_BIB6","first-page":"100","article-title":"Alternating automata and infinite objects, determinancy and Rabin's Theorem","volume":"192","author":"Muller","year":"1985"},{"key":"10.1016\/0020-0190(90)90029-W_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\/0020-0190(90)90029-W_BIB8","article-title":"Alternating automata and the exponential decidability of an extended branching-time temporal logic","author":"Muller","year":"1987","journal-title":"Manuscript"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090029W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090029W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:20:58Z","timestamp":1555089658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090029W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["002001909090029W"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90029-w","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}