Skip to main content
Log in

The reliability of discrete automata

  • Published:
Cybernetics Aims and scope

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow, 1962.

    Google Scholar 

  2. Yu. V. Kapitonova, “Coding of abstract automata by C-codes,” Kibernetika [Cybernetics], no. 1, Kiev, 1965.

  3. L. V. Matsevityi and E. L. Denisenko, “Coding the internal states of some multicycle devices,” Kibernetika [Cybernetics], no. 1, Kiev, 1966.

  4. E. I. Piil, “Coding the internal states of a finite automaton,” Izvestiya AN SSSR, Tekhnicheskaya kibernetika, no. 2, Moscow, 1965.

  5. S. H. Unger, Hazards and Delays in Asynchronous Sequential Switching Circuits. IRE Trans, v. CT-6, N 1, 1959.

  6. C. E. Shannon and E. Moore, “Reliable circuits from unreliable relays” [Russian translation], Kiberneticheskii Sbornik, no. 1, IL, Moscow, 1960.

    Google Scholar 

  7. J. Neyman, “Probability logic and the synthesis of reliable organisms from unreliable components,” collection: Automata [Russian translation], IL, Moscow, 1956.

    Google Scholar 

  8. M. A. Gavrilov, “Structural redundance and the reliability of operation of relay devices,” Proceedings of the First IFAC Congress [in Russian], vol. 3, Izd-vo AN SSSR, Moscow, 1960.

    Google Scholar 

  9. W. W. Peterson, Error-Correcting Codes, [Russian translation], izd-vo “Mir,” Moscow, 1964.

    Google Scholar 

  10. I. N. Bogolyubov, B. L. Ovsievich, and L. Ya. Rozenblyum, “Synthesis of schemes of threshold and majority elements,” collection: Information Transmitting Networks and their Automation [in Russian], izd-vo “Nauka,” Moscow, 1965.

    Google Scholar 

  11. V. I. Varshavskii, “Some problems of the theory of logic nets constructed from threshold elements,” collection: Problems of the Theory of Mathematical Machines [in Russian], no. 2, Moscow, 1962.

  12. R. S. Stearns and I. Hartmanis, On the State Assignment Problem for Sequential Machines. II, IRE trans, v. EC-10, N 4, 1961.

  13. Yu. L. Sagalovich, “A method of raising the reliability of a finite automaton,” Problemy peredachi informatsii [Problems of Information Transmission], no. 2, Moscow, 1965.

Download references

Authors

Additional information

Kibernetika, Vol. 4, No. 1, pp. 1–7, 1968

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lazarev, V.G., Piil, E.I. & Turuta, E.N. The reliability of discrete automata. Cybern Syst Anal 4, 1–6 (1968). https://doi.org/10.1007/BF01074746

Download citation

  • Issue Date:

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

Keywords

Navigation