Skip to main content
SpringerLink
Log in

Counting automata and unsolvable problems of discrete control

  • Published:
Radiophysics and Quantum Electronics 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. P. Fisher and A. Meyer, Mathematical Systems Theory,2, No. 2, 265 (1968).

    Google Scholar 

  2. P. Fisher, Information and Control,9, 364 (1966).

    Google Scholar 

  3. M. Davis, H. Putnam, and J. Robinson, Ann. Math.,74, 423 (1961); Mathematics (Collection of translations),8, No. 5 (1964).

    Google Scholar 

  4. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill (1966).

Download references

Authors
  1. L. P. Gavrilova
    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

Gor'kii State University. Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Radiofizika, Vol. 13, No. 4, pp. 534–538, April, 1970.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gavrilova, L.P., Kogan, D.I. Counting automata and unsolvable problems of discrete control. Radiophys Quantum Electron 13, 415–418 (1970). https://doi.org/10.1007/BF01030647

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation