{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:52Z","timestamp":1720201072957},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90123-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"259-274","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["The greatest fixed-points and rational omega-tree languages"],"prefix":"10.1016","volume":"44","author":[{"given":"Masako","family":"Takahashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0304-3975(86)90123-4_BIB1","first-page":"445","article-title":"The metric space of infinite trees: Algebraic and topological properties","volume":"III","author":"Arnold","year":"1980","journal-title":"Fund. Inform."},{"issue":"1","key":"10.1016\/0304-3975(86)90123-4_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","article-title":"Equivalences and transformations of regular systems\u2014applications to recursive program schemes and grammars","volume":"42","author":"Courcelle","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90123-4_BIB3","series-title":"Automata Languages and Programming","first-page":"225","article-title":"Induction rules and termination proofs","author":"Hitchcock","year":"1973"},{"key":"10.1016\/0304-3975(86)90123-4_BIB4","series-title":"Rept. C-62 and C-73","article-title":"Some classes of infinite tree languages I and II","author":"Moriya","year":"1984"},{"key":"10.1016\/0304-3975(86)90123-4_BIB5","first-page":"1","article-title":"Infinite words, infinite trees, infinite computations","volume":"109","author":"Nivat","year":"1979","journal-title":"Math. Centre Tracts"},{"key":"10.1016\/0304-3975(86)90123-4_BIB6","series-title":"Rept. 85-75","article-title":"Rational, recognizable and computable infinite tree languages","author":"Nivat","year":"1985"},{"key":"10.1016\/0304-3975(86)90123-4_BIB7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","article-title":"Concurrency and automata on infinite sequences","volume":"10","author":"Park","year":"1981","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0304-3975(86)90123-4_BIB8","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\/0304-3975(86)90123-4_BIB9","series-title":"Mathematica Logic and Foundations of Set Theory","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0049-237X(08)71929-3","article-title":"Weakly definable relations and special automata","author":"Rabin","year":"1970"},{"key":"10.1016\/0304-3975(86)90123-4_BIB10","first-page":"595","article-title":"Decidable theories","author":"Rabin","year":"1977"},{"key":"10.1016\/0304-3975(86)90123-4_BIB11","first-page":"379","article-title":"Automatatheoretische und automatenfreie Characterisierungen topologischer Klasses regularer Folgenmengen","volume":"10","author":"Staiger","year":"1974","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"10.1016\/0304-3975(86)90123-4_BIB12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(83)90057-9","article-title":"A note on \u03c9-regular languages","volume":"23","author":"Takahash","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90123-4_BIB13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretic fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/0304-3975(86)90123-4_BIB14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision problems of second-order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"},{"issue":"4","key":"10.1016\/0304-3975(86)90123-4_BIB15","first-page":"863","article-title":"Fixed points in the power set algebra of infinite trees","volume":"IV","author":"Tiuryn","year":"1981","journal-title":"Fund. Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:53:26Z","timestamp":1553201606000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":15,"alternative-id":["0304397586901234"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90123-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}