Skip to main content
SpringerLink
Log in

Additively controlled systems and languages

Some algorithmic problems

  • 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. L. P. Gavrilova and D. I. Kogan, “Computing automata and insoluble problems of discrete control,” Izv. VUZov, Radiofizika, Moscow,13, No. 4 (1970).

  2. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Fizmatgiz, Moscow (1965).

    Google Scholar 

  3. P. Fischer, A. Meyer, and A. Rosenberg, “Counter machines and counter languages,” Mathematical Systems Theory,2, No. 3 (1968).

  4. S. C. Kleene, Introduction to Mathematics, Am. Elsevier (1971).

  5. R. Parikh, “On context-free languages,” Journal of the Association for Computing Machinery,13 (1966).

Download references

Authors
  1. Yu. V. Glebskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. I. Kogan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4: pp. 25–29, July–August, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glebskii, Y.V., Kogan, D.I. Additively controlled systems and languages. Cybern Syst Anal 7, 602–607 (1971). https://doi.org/10.1007/BF01071031

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation