Abstract
We investigate the generative capacity of tree controlled context-free, λ-free context-free, and regular grammars with type-i control language,i=0, 1, 2, 3, 4 (i=4 stands for finite languages).
Zusammenfassung
Wir studieren die erzeugende Kraft von umgebungs-unabhängigen, λ-freien umgebungs-unabhängigen und regulären Grammatiken, die auf ihren Bäumen durch Sprachen vom Typi, i=0, 1, 2, 3, 4 kontrolliert sind.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brainerd, B.: An analog of a theorem about context-free languages. Inform. Contr.11, 561–568 (1968).
Culik, K. II, Maurer, H. A.: Tree controlled grammars. Computing19, 129–139 (1977).
Maurer, H. A.: Simple matrix languages with a leftmost restriction. Inform. Contr.23, 128–139 (1973).
Paun, Gh.: On the family of finite index matrix languages. Journal of Computer and System Sciences. (In press.)
Salomaa, A.: Formal Languages. New York-London: Academic Press 1973.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Paun, G. On the generative capacity of tree controlled grammars. Computing 21, 213–220 (1979). https://doi.org/10.1007/BF02253054
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02253054