{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:48:19Z","timestamp":1648810099774},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"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":[[1982,10]]},"DOI":"10.1016\/0020-0190(82)90097-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"159-163","source":"Crossref","is-referenced-by-count":7,"title":["Determinancy of sinking automata on infinite trees and inequalities between various Rabin's pair indices"],"prefix":"10.1016","volume":"15","author":[{"given":"A.","family":"W\u0142odzimierz Mostowski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90097-7_BIB1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by a finite automaton","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(82)90097-7_BIB2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/3-540-10854-8_49","article-title":"The complexity of automata and subtheories of monadic second-order arithmetics","volume":"117","author":"Mostowski","year":"1981","journal-title":"Lect. Notes in Comput. Sci."},{"key":"10.1016\/0020-0190(82)90097-7_BIB3","article-title":"On Rabin pair index of automata","author":"Mostowski","year":"1981","journal-title":"Proc. Workshop on Algorithms and Computing Theory"},{"key":"10.1016\/0020-0190(82)90097-7_BIB4","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(82)90097-7_BIB5","first-page":"239","article-title":"Decidability and definiability in second-order theories","volume":"1","author":"Rabin","year":"1970","journal-title":"Act. Congr. Internat. Math."},{"key":"10.1016\/0020-0190(82)90097-7_BIB6","doi-asserted-by":"crossref","unstructured":"J.W. Thatcher and J.B. Wright, Generalised finite automata theory with an application to a decision procedure of second-order logic, Math. System Theory 2 (1) 57-81.","DOI":"10.1007\/BF01691346"},{"key":"10.1016\/0020-0190(82)90097-7_BIB7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","article-title":"On \u03c9-regular sets","volume":"43","author":"Wagner","year":"1979","journal-title":"Inform. and Control"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900977?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900977?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:55:00Z","timestamp":1555088100000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082900977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0020019082900977"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90097-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}