Skip to main content
SpringerLink
Log in

Recognition of properties of autonomous structural automata

  • 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. V. M. Glushkov, Synthesis of Finite Automata [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  2. S. V. Yablonskii, “On algorithmic difficulties of the synthesis of minimal contact circuits, in: Problems of Cybernetics [in Russian], No. 2, Fizmatgiz, Moscow (1959), pp. 75–121.

    Google Scholar 

  3. A. Aho, J. Hopcroft, and D. Ullman, Construction and Analysis of Calculation Algorithms [Russian translation], Mir, Moscow (1979), Chap. 10.

    Google Scholar 

  4. R. Karp, “On the convergence on combinatorial problems,” in: Cybernetic Collection [Russian translation], No. 12, Mir, Moscow (1975), pp. 16–38.

    Google Scholar 

  5. L. Stockmeyer and A. Meyer, “Word problems requiring exponential time,” in: Proc. Fifth Annual ACM Symposium on Theory of Computing, New York (1973), pp. 1–9.

Download references

Authors
  1. I. K. Rystsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 40–41, January–February, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rystsov, I.K. Recognition of properties of autonomous structural automata. Cybern Syst Anal 16, 44–46 (1980). https://doi.org/10.1007/BF01099360

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation