Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Certain questions in the theory of grammar of quasi-recursive generation

  • 9 Accesses

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

    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).

  2. 2.

    V. N. Red'ko, “Parametric grammar and the parametrization problem,” in: Automation of Programming [in Russian], Kiev (1968).

  3. 3.

    V. N. Red'ko, “Interpretation of languages and interpreters,” Kibernetika, No. 5 (1969).

  4. 4.

    S. Y. Kuroda, “Classes of languages and linear-bounded automata,” Inf. Control7, No. 2 (1964).

  5. 5.

    E. Navratil, “Context-free grammars with regular conditions,” Kibernetika, No. 2 (1970).

Download references

Additional information

Translated from Kibernetika, No. 2, pp. 136–139, March–April, 1974.

Rights and permissions

Reprints and Permissions

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

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory