Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Some properties of the set of experiments of an automaton

  • 12 Accesses

  • 1 Citations

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

References

  1. 1.

    E. F. Moore, “Gedanken experiments on sequential machines,” collection: Automata [Russian translation], IL, Moscow 179–210, 1965.

  2. 2.

    M. A. Spivak, “The representation of automaton mappings by regular expressions,” Kibernetika [Cybernetics], no. 6, Kiev, 1965.

  3. 3.

    V. M. Glushkov, “Abstract theory of automata,” Uspekhi matematicheskikh nauk, Moscow, 16, no. 5, 3–62, 1961.

  4. 4.

    M. A. Spivak, “A new algorithm for the abstract synthesis of automata,” Materials of Scientific Seminars on Theoretical and Applied Problems of Cybernetics. Theory of Automata [in Russian], KNDTP, Kiev, 1963.

  5. 5.

    N. Bourbaki, Theorie des Ensembles [Russian translation], izd-vo Mir, Moscow, 1965.

  6. 6.

    M. O. Rabin and D. Scott, “Finite automata and their decision problems,” [Russian translation], Kiberneticheskii sbornik, no. 4, IL, Moscow, 58–91, 1962.

Download references

Additional information

Kibernetika, Vol. 2, No. 6, pp. 1–7, 1966

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Spivak, M.A. Some properties of the set of experiments of an automaton. Cybern Syst Anal 2, 1–5 (1966). https://doi.org/10.1007/BF01074487

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory