Skip to main content
SpringerLink
Log in

Experiments on recognizing output functions of 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. A. Gill, Introduction to the Theory of Finite-State Machines, McGraw-Hill, New York (1962).

    Google Scholar 

  2. D. V. Speranskii, “On one experiment with automata,” in: Kibernetika (Donets Branch), Kiev (1968), Vol. 1.

    Google Scholar 

  3. V. G. Vizing and M. K. Gol'dberg, “The length of a circuit of a strongly connected graph,” Kibernetika, No. 1 (1969).

  4. M. A. Spivak, “Generalized problems of diagnosis and establishment for finite automata,” Izv. Akad. Nauk SSSR, Tekhnicheskaya Kibernetika, No. 3 (1969).

  5. T. N. Hibbard, “Exact upper bounds on the length of minimal experiments defining the final state for two classes of sequential machines,” in: Cybernetics Collection, New Series No. 2 [Russian translation], Mir, Moscow (1966).

    Google Scholar 

Download references

Authors
  1. D. V. Speranskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 39–43, November–December, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Speranskii, D.V. Experiments on recognizing output functions of automata. Cybern Syst Anal 7, 983–987 (1971). https://doi.org/10.1007/BF01068821

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation