{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:54Z","timestamp":1761610194462,"version":"build-2065373602"},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6784,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(04)80019-7","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T15:29:25Z","timestamp":1096385365000},"page":"313-333","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Computability and Complexity from a Programming Perspective (MFPS Draft preview)"],"prefix":"10.1016","volume":"1","author":[{"given":"Neil D.","family":"Jones","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80019-7_NEWBIB1","series-title":"Results and Trends in Theoretical Computer Science, Lecture Notes in Computer Science 812","first-page":"1","article-title":"Generalizing Cook's construction to imperative stack programs","author":"Andersen","year":"1994"},{"key":"10.1016\/S1571-0661(04)80019-7_NEWBIB2","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 Stephen","year":"1971","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)80019-7_NEWBIB3","series-title":"Information Processing (IFIP) 71","first-page":"75","article-title":"Linear-time simulation of deterministic two-way pushdown automata","author":"Cook Stephen","year":"1972"},{"key":"10.1016\/S1571-0661(04)80019-7_NEWBIB4","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0020-0190(77)90022-9","article-title":"A note on linear-time simulation of deterministic two-way pushdown automata","volume":"6","author":"Jones","year":"1977","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(04)80019-7_NEWBIB5","unstructured":"Neil D. Jones, C.K. Gomard, P. Sestoft, \u201cPartial Evaluation and Automatic Program Generation,\u201d Prentice Hall International Series in Computer Science, 1993."},{"key":"10.1016\/S1571-0661(04)80019-7_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Jones, N. D., Constant time factors do matter, ACM Symposium on Theory of Computing, ACM Press, S. Homer (ed.) (1993), 602\u2013611.","DOI":"10.1145\/167088.167244"},{"key":"10.1016\/S1571-0661(04)80019-7_NEWBIB7","unstructured":"Hessellund M., Dahl F., student report, DIKU, University of Copenhagen, 1994."},{"key":"10.1016\/S1571-0661(04)80019-7_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Philip L. Wadler, Deforestation: transforming programs to eliminate trees. European Symposium On Programming (ESOP). Lecture Notes in Computer Science 300, pp. 344\u2013358, Nancy, France, Springer-Verlag, 1988.","DOI":"10.1007\/3-540-19027-9_23"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800197?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800197?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:04:03Z","timestamp":1761609843000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104800197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":8,"alternative-id":["S1571066104800197"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80019-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computability and Complexity from a Programming Perspective (MFPS Draft preview)","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80019-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}