{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T07:27:51Z","timestamp":1725694071226},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540079125"},{"type":"electronic","value":"9783642952890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1976]]},"DOI":"10.1007\/978-3-642-95289-0_6","type":"book-chapter","created":{"date-parts":[[2012,7,28]],"date-time":"2012-07-28T20:50:54Z","timestamp":1343508654000},"page":"76-85","source":"Crossref","is-referenced-by-count":0,"title":["Zur Analysenkomplexitaet von Grammatiken und Pushdown-Akzeptoren, die Hilfszaehler Verwenden"],"prefix":"10.1007","author":[{"given":"J.","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Erni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A Aho","year":"1968","unstructured":"Aho, A., Indexed Grammars \u2014 An Extension of Context-Free Grammars, Journal of the ACM, vol. 15, 1968, pp. 647\u2013671.","journal-title":"Journal of the ACM"},{"key":"6_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullmann, J., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"6_CR3","volume-title":"\u00dcber indizierte und m-Block-indizierte Grammatiken, Dissertation am Inst. f. Angew. Informatik, Universit\u00e4t Karlsruhe","author":"J Albert","year":"1976","unstructured":"Albert, J., \u00dcber indizierte und m-Block-indizierte Grammatiken, Dissertation am Inst. f. Angew. Informatik, Universit\u00e4t Karlsruhe, 1976."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B Baker","year":"1974","unstructured":"Baker, B. and Book, R., Reversal-Bounded Multi-Pushdown Machines, Journal of Computer and System Sciences, vol. 8, 1974, pp. 315\u2013332.","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01705890","volume":"4","author":"R Book","year":"1970","unstructured":"Book, R. and Ginsburg, S., Multi-Stack-Counter Languages, Mathematical Systems Theory, vol. 4, 1970, pp. 97\u2013111.","journal-title":"Mathematical Systems Theory"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"S Cook","year":"1971","unstructured":"Cook, S., Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, Journal of the ACM 18, 1971, pp. 4\u201318.","journal-title":"Journal of the ACM"},{"key":"6_CR7","volume-title":"Ph.D. Thesis, Carnegie Mellon-University","author":"J Earley","year":"1968","unstructured":"Earley, J., An Efficient Contextfree Parsing Algorithm, Ph.D. Thesis, Carnegie Mellon-University, 1968."},{"key":"6_CR8","unstructured":"Erni, W., Complexity of Recognition for Some Language Families Between Contextfree and Contextsensitive, ersch. demn\u00e4chst als Forschungsbericht des Inst. f. Angew. Informatik, Universit\u00e4t Karlsruhe."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0019-9958(74)80062-8","volume":"24","author":"A Fleck","year":"1974","unstructured":"Fleck, A., An Analysis of Grammars by Their Derivation Sets, Information and Control 24, 1974, pp. 389\u2013398.","journal-title":"Information and Control"},{"key":"6_CR10","volume-title":"Formal Languages","author":"S Ginsburg","year":"1975","unstructured":"Ginsburg, S., Formal Languages, American Elsevier, 1975."},{"key":"6_CR11","volume-title":"Jump PDAs, Deterministic Contextfree Languages, Principal AFDLs and Polynomial Time Recognition","author":"S Greibach","year":"1973","unstructured":"Greibach, S., Jump PDAs, Deterministic Contextfree Languages, Principal AFDLs and Polynomial Time Recognition, 5th ACM-Symposiurn on Theory of Computing, 1973."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0022-0000(69)80015-2","volume":"3","author":"S Greibach","year":"1969","unstructured":"Greibach, S. and Hopcroft, J., Scattered Context Grammars, Journal of Computer and System Sciences, vol. 3, 1969, pp. 233\u2013247.","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR13","volume-title":"Computational Parallels Between the Regular and Contextfree Languages","author":"H Hunt","year":"1974","unstructured":"Hunt, H., Computational Parallels Between the Regular and Contextfree Languages, 6 ACM Symposium on Theory of Computing, 1974."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0020-0190(75)90027-7","volume":"3","author":"J Leeuwen van","year":"1975","unstructured":"Leeuwen, J.van, The Membership Question for ETOL-Languages is Polynomially Complete, Inf. Proc. Letters 3, 1975, pp. 138\u2013143.","journal-title":"Inf. Proc. Letters"},{"key":"6_CR15","volume-title":"Time Complexity of Recognition and Parsing of EOL-Languages","author":"J Opatrny","year":"1974","unstructured":"Opatrny, J. and Cu1ik, K.II, Time Complexity of Recognition and Parsing of EOL-Languages, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1974."},{"key":"6_CR16","volume-title":"Complexity of Recognition in Intermediate Level Languages","author":"W Rounds","year":"1973","unstructured":"Rounds, W., Complexity of Recognition in Intermediate Level Languages, IEEE 14th Symposium on Switching Automata Theory, 1973."},{"key":"6_CR17","unstructured":"Rozenberg, G., Sa1omaa, A., L Systems, Lecture Notes in Computer Science 15, Springer Verlag."},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-06841-4_50","volume":"14","author":"E Shamir","year":"1974","unstructured":"Shamir, E. and Beeri, C., Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages, Lecture Notes of Computer Science 14, 1974, pp. 27\u201333.","journal-title":"Lecture Notes of Computer Science"},{"key":"6_CR19","volume-title":"On Languages Log-Tape Reducible to Contextfree Languages","author":"IH Sudborough","year":"1976","unstructured":"Sudborough, I.H., On Languages Log-Tape Reducible to Contextfree Languages, Manuskript f\u00fcr einen Vortrag bei der J. Hopkins Konferenz, 1976."}],"container-title":["GI \u2014 6. Jahrestagung"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-95289-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T20:09:31Z","timestamp":1606507771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-95289-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"ISBN":["9783540079125","9783642952890"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-95289-0_6","relation":{},"subject":[],"published":{"date-parts":[[1976]]}}}