This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Blum, M., A machine independent theory of the complexity of recursive functions. J. Assoc. Comput. Mach., 14 (1967), 322–336.
Gladkii, A.V., Formal grammars and languages. Nauka, M., 1973 (russ.) (submitted for translation into English in North-Holland Publishing Co.)
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).
Dikovskii, A.Ja.}, On the general notion of complexity of derivation in a context-free grammar. Soviet Math. Dokl., 15 (1974), 98–102.
Brainerd, B., An analog of a theorem about context-free languages. Inform. and Control, 11 (1967), 561–567.
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–70, 1970. Novosibirsk, 1970 (russ.).
Ginsburg, S. and Greibach, S.A., Abstract families of languages. In "Studies in Abstract Families of Languages", Memoirs of the AMS, 87 (1969), 1–32.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dikovskii, A.J. (1975). On closure properties of context-free derivation complexity classes. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_197
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_197
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive