{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:53:18Z","timestamp":1648540398893},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"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":10638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,6]]},"DOI":"10.1016\/0022-0000(84)90021-7","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"395-419","source":"Crossref","is-referenced-by-count":4,"title":["The complexity of monadic recursion schemes: exponential time bounds"],"prefix":"10.1016","volume":"28","author":[{"suffix":"III","given":"H.B.","family":"Hunt","sequence":"first","affiliation":[]},{"given":"D.J.","family":"Rosenkrantz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90021-7_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(84)90021-7_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\/0022-0000(84)90021-7_BIB3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterizations of pushdown machines in terms of time-bounded computers","volume":"18","author":"Cook","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90021-7_BIB4","series-title":"A theory of programs","author":"Debakker","year":"1969"},{"key":"10.1016\/0022-0000(84)90021-7_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\/0022-0000(84)90021-7_BIB6","series-title":"Proceedings 14th Annual Symposium on Switching and Automata Theory","first-page":"26","article-title":"Equivalence problems in monadic recursion schemes","author":"Friedman","year":"1973"},{"key":"10.1016\/0022-0000(84)90021-7_BIB7","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\/0022-0000(84)90021-7_BIB8","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. and Control"},{"key":"10.1016\/0022-0000(84)90021-7_BIB9","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":"1963","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90021-7_BIB10","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0022-0000(84)90021-7_BIB11","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\/0022-0000(84)90021-7_BIB12","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\/0022-0000(84)90021-7_BIB13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(83)90091-9","article-title":"The complexity of monadic recursion schemes: Executability problems, nesting depth, and applications","volume":"27","author":"Hunt","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90021-7_BIB14","series-title":"Proceedings, 21st Annual Symposium on Foundations of Computer Science","first-page":"213","article-title":"The complexity of recursion schemes and recursive programming languages","author":"Hunt","year":"1980"},{"key":"10.1016\/0022-0000(84)90021-7_BIB15","series-title":"Cybernetics Problems 1","first-page":"82","article-title":"On logical algorithm schemta","author":"Ianov","year":"1968"},{"key":"10.1016\/0022-0000(84)90021-7_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321203.321204","article-title":"On lanov's program schemata","volume":"11","author":"Rutledge","year":"1964","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:26Z","timestamp":1550307086000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["0022000084900217"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90021-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}