Summary
A derivation language associated with a context-free grammar is the set of all terminating derivations. Hierarchy and closure properties of these languages are considered. In addition to the formerly known solvability of the emptiness and finiteness problems the equivalence problem is shown to be solvable for derivation languages.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brauer, W.: On grammatical complexity of context-free languages. In: Havel, I. M. (ed.): Mathematical Foundations of Computer Science 1973, p. 191–196
Moriya, E.: The associate language and the derivation properties of formal grammars. Information and Control 22, 139–162 (1973)
Salomaa, A.: Formal languages. London-New York: Academic Press 1973
Stotskij, E. D.: Some restrictions on derivations in context-sensitive grammars. Nauchno-Techn. Inform. Ser. 2 (7), 35–38 (1967)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Penttonen, M. On derivation languages corresponding to context-free grammars. Acta Informatica 3, 285–291 (1974). https://doi.org/10.1007/BF00288639
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288639