Skip to main content
SpringerLink
Log in

Syntactic properties of recursive program schemes

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. A. V. Anisimov, “Formal grammars taking into account external terminal contexts,” Kibernetika, No. 3, 81–88 (1974).

    Google Scholar 

  2. A. V. Anisimov, “On the control apparatus in pasers,” Kibernetika, No. 6, 57–59 (1974).

    Google Scholar 

  3. V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers,” in: Selected Questions of Algebra and Logic [in Russian], Novosibirsk (1973).

  4. A. P. Ershov, “Present state of the theory of program schemes,” in: Problems of Cybernetics [in Russian], Vol. 27, Moscow (1973).

  5. A. P. Ershov, “On Yanov operator schemes,” in: Problems of Cybernetics [in Russian], Vol. 20, Nauka, Moscow (1967).

    Google Scholar 

  6. V. N. Red'ko, “Parametric grammars and the problem of parametrization,” in: Automatic Programming [in Russian], Vol. 1, Izd. Akad. Nauk UkrSSR, Inst. Kibernetiki, Kiev (1969).

    Google Scholar 

  7. V. K. Sabel'fel'd, “On the transformation of monadic linear recursive schemes,” Kibernetika, No. 5, 56–63 (1975).

    Google Scholar 

  8. Yu. I. Yanov, “On logical schemes of algorithms,” in: Problems ofCybernetics [in Russian], Vol. 1, Moscow (1958).

  9. Yu. I. Yanov, “On local transformations of algorithm schemes,” in: Problems of Cybernetics [in Russian], Vol. 20, Nauka, Moscow (1967).

    Google Scholar 

  10. E. Ashcroft, Z. Manna, and A. Pnueli, “Decidable properties of monadic functional schema,” J. Assoc. Comput. Mach.,20 (1973).

  11. J. W. de Bakker and D. A. Scott, A Theory of Programs, Unpublished Report (August, 1969).

  12. S. J. Carland and D. C. Luckham, “Program schemes, recursion schemes, and formal languages,” J. CSS,7, No. 2 (1973).

    Google Scholar 

  13. S. A. Greibach, “A note on push-down store automata and regular systems,” Proc. Amer. Math. Soc.,18 (1967).

  14. J. Engelfriet, “Simple program schemes and formal languages,” in: Lecture Notes in Computer Science, Vol. 20 (1974).

  15. R. Kurki-Suonio, “Notes on top-down languages,” in: BIT, Nordisk Tidskrift für Informations Behandlung, Vol. 9, Copenhagen (1969).

  16. D. C. Luckham, D.M.R. Parks, and M. S. Paterson, “On formalized computer programs,” J. CSS,4, No. 3 (1970).

  17. D. Rosenkrantz and R. E. Stearms, “Properties of deterministic top-down grammars,” Inf. Control,17, No. 3 (1970).

    Google Scholar 

  18. J. D. Rutledge, “On Yanov's program schemata,” J. Assoc. Comput. Mach.,11 (1964).

Download references

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 51–59, May–June, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V. Syntactic properties of recursive program schemes. Cybern Syst Anal 13, 365–374 (1977). https://doi.org/10.1007/BF01069653

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01069653

Keywords

Search

Navigation