This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
V. N. Red'ko, “Parametric grammar and the problem of the syntactic analysis of languages,” in: Second All-Union Conference on Programming [in Russian], Novosibirsk (1970).
V. N. Red'ko, “Parametric grammar and the parametrization problem,” in: Automation of Programming [in Russian], Kiev (1968).
V. N. Red'ko, “Interpretation of languages and interpreters,” Kibernetika, No. 5 (1969).
S. Y. Kuroda, “Classes of languages and linear-bounded automata,” Inf. Control7, No. 2 (1964).
E. Navratil, “Context-free grammars with regular conditions,” Kibernetika, No. 2 (1970).
Translated from Kibernetika, No. 2, pp. 136–139, March–April, 1974.
About this article
Cite this article
Byts, V.V. Certain questions in the theory of grammar of quasi-recursive generation. Cybern Syst Anal 10, 352–356 (1974). https://doi.org/10.1007/BF01068960
- Operating System
- Artificial Intelligence
- System Theory