{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:33:34Z","timestamp":1649180014258},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(83)90091-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"3-38","source":"Crossref","is-referenced-by-count":1,"title":["The complexity of monadic recursion schemes: Executability problems, nesting depth, and applications"],"prefix":"10.1016","volume":"27","author":[{"suffix":"III","given":"H.B.","family":"Hunt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.J.","family":"Rosenkrantz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90091-9_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(83)90091-9_BIB2","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/321765.321780","article-title":"Decidable properties of monadic functional schemes","volume":"20","author":"Ashcroft","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(83)90091-9_BIB3","article-title":"A theory of programs","author":"de Bakker","year":"1969","journal-title":"IBM Seminar"},{"key":"10.1016\/0304-3975(83)90091-9_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ita\/1981150100671","article-title":"A theory of complexity of monadic recursion schemes","volume":"15","author":"Dikovskii","year":"1981","journal-title":"RAIRO Informatique Theorique"},{"key":"10.1016\/0304-3975(83)90091-9_BIB5","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/S0022-0000(77)80019-6","article-title":"Equivalence problems for deterministic context-free languages and monadic recursion schemes","volume":"14","author":"Friedman","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90091-9_BIB6","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(79)90034-5","article-title":"Monadic recursion schemes: The effect of constants","volume":"18","author":"Friedman","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90091-9_BIB7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0019-9958(75)90175-8","article-title":"Functional schemes with nested predicates","volume":"27","author":"Galil","year":"1975","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(83)90091-9_BIB8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(73)80040-6","article-title":"Program schemes, recursion schemes, and formal languages","volume":"7","author":"Garland","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90091-9_BIB9","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322290.322304","article-title":"Complexity of flowchart and loop program schemes and programming languages","volume":"29","author":"Hunt","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(83)90091-9_BIB10","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/0209031","article-title":"On the computational complexity of program scheme equivalence","volume":"9","author":"Hunt","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90091-9_BIB11","unstructured":"H.B. Hunt III and D.J. Rosenkrantz, The complexity of monadic recursion schemes: Executability problems and exponential time bounds, J. Comput. System Sci., to appear."},{"key":"10.1016\/0304-3975(83)90091-9_BIB12","first-page":"213","article-title":"The complexity of recursion schemes and recursive programming languages","author":"Hunt","year":"1980","journal-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(83)90091-9_BIB13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationship between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900919?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900919?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:50:04Z","timestamp":1555113004000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900919"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90091-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}