{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:58Z","timestamp":1725663298740},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540127277"},{"type":"electronic","value":"9783540387145"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12727-5_23","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:54:52Z","timestamp":1330192492000},"page":"367-376","source":"Crossref","is-referenced-by-count":0,"title":["Remarks on the pyramidal structure"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Rytter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"23_CR1","first-page":"3","volume":"13","author":"A. V. Aho","year":"1968","unstructured":"Aho A.V,Hopcroft J.E,Ullman J.D. Time and tape complexity of pushdown automaton languages. Inf.and Control 13:3 (1968)","journal-title":"Inf.and Control"},{"key":"23_CR2","unstructured":"Aho A.V,Hopcroft J.E,Ullman J.D. The design and analysis of computer algorithms. Section 9.4. Addison-Wesley (1976)"},{"key":"23_CR3","unstructured":"Cook S.A. Linear time simulation of deterministic two-way pushdown automata. Proc.IFIP Congress 1971."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0020-0190(81)90065-X","volume":"12","author":"W. Rytter","year":"1981","unstructured":"Rytter W. An efficient simulation of deterministic pushdown automata with many two-way and one-way heads. Inf.Proc.Letters 12:5 (1981)","journal-title":"Inf.Proc.Letters"},{"key":"23_CR5","first-page":"2","volume":"13","author":"W. Rytter","year":"1981","unstructured":"Rytter W. The dynamic simulation of recursive and stack manipulating programs. Inf.Proc.Letters 13:2 (1981)","journal-title":"Inf.Proc.Letters"},{"key":"23_CR6","unstructured":"Rytter W. A note on the complexity of traversing a labyrinth. Graph Theory Conf. Lagov,Poland, february 1981"},{"key":"23_CR7","unstructured":"Schonhage A. Storage modification machines. SIAM J.Comp. august1981"},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/356827.356831","volume":"12","author":"R. Bird","year":"1980","unstructured":"Bird R. Tabulation techniques for recursive programs. ACM Comp. Surveys 12:4 (1980)","journal-title":"ACM Comp. Surveys"}],"container-title":["Lecture Notes in Computer Science","CAAP'83"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12727-5_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:50:55Z","timestamp":1619556655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12727-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540127277","9783540387145"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-12727-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}