{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:14:24Z","timestamp":1725459264434},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354006527X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039149","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T09:19:46Z","timestamp":1138180786000},"page":"149-155","source":"Crossref","is-referenced-by-count":0,"title":["Zur Komplexit\u00e4t gesteuerter kontextfreier Ersetzungen"],"prefix":"10.1007","author":[{"given":"A. B.","family":"Cremers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Mayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Weiss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"61","volume":"4","author":"S. Abraham","year":"1965","unstructured":"ABRAHAM, S. (1965). Some Questions of Phrase Structure Grammars. Computational Linguistics, 4, 61\u201370.","journal-title":"Computational Linguistics"},{"key":"17_CR2","unstructured":"CREMERS, A.B., O. MAYER, K. WEISS (1973). On the complexity of regulated context-free rewriting. Erscheint in Information and Control."},{"key":"17_CR3","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"GINSBURG, S. (1966). The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/S0019-9958(69)90055-2","volume":"14","author":"J. Gruska","year":"1969","unstructured":"GRUSKA, J. (1969). Some Classifications of Context-Free Languages. Information and Control 14, 152\u2013179.","journal-title":"Information and Control"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/321495.321504","volume":"16","author":"D. Rosenkrantz","year":"1969","unstructured":"ROSENKRANTZ, D. (1969). Programmed Grammars and Classes of Formal Languages. Journal of the ACM 16, 107\u2013131.","journal-title":"Journal of the ACM"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/S0019-9958(69)90164-8","volume":"14","author":"A. Salomaa","year":"1969","unstructured":"SALOMAA, A. (1969). On the Index of a Context-Free Grammar and Language. Information and Control 14, 474\u2013477.","journal-title":"Information and Control"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/S0019-9958(70)90464-X","volume":"17","author":"A. Salomaa","year":"1970","unstructured":"SALOMAA, A. (1970). Periodically Time-Variant Context-Free Grammars. Information and Control 17, 294\u2013311.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","GI Gesellschaft f\u00fcr Informatik e. V. 1. Fachtagung \u00fcber Automatentheorie und Formale Sprachen"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039149.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:24:40Z","timestamp":1607534680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354006527X"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0039149","relation":{},"subject":[]}}