{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:14Z","timestamp":1725662894660},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540073895"},{"type":"electronic","value":"9783540375852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07389-2_197","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:54:58Z","timestamp":1330185298000},"page":"206-211","source":"Crossref","is-referenced-by-count":1,"title":["On closure properties of context-free derivation complexity classes"],"prefix":"10.1007","author":[{"given":"A. Ja.","family":"Dikovskii","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M., A machine independent theory of the complexity of recursive functions. J. Assoc. Comput. Mach., 14 (1967), 322\u2013336.","journal-title":"J. Assoc. Comput. Mach."},{"unstructured":"Gladkii, A.V., Formal grammars and languages. Nauka, M., 1973 (russ.) (submitted for translation into English in North-Holland Publishing Co.)","key":"20_CR2"},{"unstructured":"Dikovskii, A.Ja., Derivation complexity in context-free grammars (general theory). Included in English translation of Gladkii [2] as an additional 9-th chapter (submitted for translation).","key":"20_CR3"},{"key":"20_CR4","first-page":"98","volume":"15","author":"Dikovskii","year":"1974","unstructured":"Dikovskii, A.Ja.}, On the general notion of complexity of derivation in a context-free grammar. Soviet Math. Dokl., 15 (1974), 98\u2013102.","journal-title":"Soviet Math. Dokl."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/S0019-9958(67)90771-1","volume":"11","author":"B. Brainerd","year":"1967","unstructured":"Brainerd, B., An analog of a theorem about context-free languages. Inform. and Control, 11 (1967), 561\u2013567.","journal-title":"Inform. and Control"},{"key":"20_CR6","first-page":"43","volume":"I","author":"Gladkii","year":"1970","unstructured":"Gladkii, A.V.} and Dikovskii, A.Ja.}, Formal grammars and languages theory. In Trans. of the 2-nd Allunion Conf. on Programming, Vol.I, pp. 43\u201370, 1970. Novosibirsk, 1970 (russ.).","journal-title":"Trans. of the 2-nd Allunion Conf. on Programming"},{"key":"20_CR7","first-page":"1","volume":"87","author":"S. Ginsburg","year":"1969","unstructured":"Ginsburg, S. and Greibach, S.A., Abstract families of languages. In \"Studies in Abstract Families of Languages\", Memoirs of the AMS, 87 (1969), 1\u201332.","journal-title":"Memoirs of the AMS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07389-2_197.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:46:00Z","timestamp":1619556360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07389-2_197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540073895","9783540375852"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-07389-2_197","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}