{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:54:47Z","timestamp":1754556887228},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540105763"},{"type":"electronic","value":"9783540385615"}],"license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/bfb0017291","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:22:34Z","timestamp":1132626154000},"page":"13-21","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the height of syntactical graphs"],"prefix":"10.1007","author":[{"given":"Franz-Josef","family":"Brandenburg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"R.V. Book, Grammars with time functions. Ph.D. Thesis, Harvard University (1969).","DOI":"10.1109\/SWAT.1968.11"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0022-0000(71)80025-9","volume":"5","author":"R.V. Book","year":"1971","unstructured":"R.V. Book, Time-bounded grammars and their languages. J. Comput. System Sci. 5 (1971), 397\u2013428.","journal-title":"J. Comput. System Sci."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1137\/0206054","volume":"6","author":"A. Borodin","year":"1977","unstructured":"A. Borodin, On relating time and space to size and depth. SIAM J. Comput. 6 (1977), 733\u2013743.","journal-title":"SIAM J. Comput."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"A. Borodin, M.J. Fischer, D.G. Kirkpatrick, N.A. Lynch and M. Tompa, A time-space tradeoff for sorting on non-oblivious machines. Proc. 20 th FOCS (1979), 319\u2013327.","DOI":"10.1109\/SFCS.1979.4"},{"key":"3_CR5","unstructured":"F.-J. Brandenburg, Die Zusammenhangskomplexit\u00e4t von nicht-kontextfreien Grammatiken. Dissertation, Universit\u00e4t Bonn (1978)."},{"key":"3_CR6","volume-title":"On the height of derivation trees. Forschungsbericht Nr. 18","author":"K. Culik II","year":"1978","unstructured":"K. Culik II and H.A. Maurer, On the height of derivation trees. Forschungsbericht Nr. 18, Institut f\u00fcr Informationsverarbeitung, TU Graz (1978)."},{"key":"3_CR7","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even, Graph Algorithms. Pitman, London (1979)."},{"key":"3_CR8","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"M.A. Harrison, Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/S0022-0000(76)80019-0","volume":"12","author":"J.M. Hart","year":"1976","unstructured":"J.M. Hart, The derivation language of a phrase-structure grammar. J. Comput. System Sci. 12 (1976), 64\u201379.","journal-title":"J. Comput. System Sci."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","volume":"16","author":"J.E. Hopcroft","year":"1969","unstructured":"J.E. Hopcroft and J.D. Ullman, Some results on tape-bounded Turing machines. J. Assoc. Comput. Mach. 16 (1969), 168\u2013177.","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF00264470","volume":"8","author":"Y. Igarashi","year":"1977","unstructured":"Y. Igarashi, General properties of derivational complexity. Acta Informatica 8 (1977), 267\u2013283.","journal-title":"Acta Informatica"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0019-9958(70)90224-X","volume":"16","author":"J. Loeckx","year":"1970","unstructured":"J. Loeckx, The parsing of general phrase-structure grammars. Inform. Contr. 16 (1970), 443\u2013464.","journal-title":"Inform. Contr."},{"key":"3_CR13","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa, Formal Languages. Academic Press, New York (1973)."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:23:48Z","timestamp":1578525828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017291"}},"subtitle":["Preliminary report"],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540105763","9783540385615"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0017291","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}