Skip to main content
  • 24 Accesses

Abstract

Much attention is being given today to the questions of the programming and subsequent computer solution of problems of synthesizing automata, since the quite complex schemes of automata which arise in practice cannot, with the existing methods, be constructed manually. However, up to now no account has been taken, in the computerizing of various steps in automata synthesis, of the fact that an automaton is built of elements subject to error, and must satisfy certain definite requirements as to the reliability of its operations.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. V. A. Gaiskii, “Method of constructing restorable control systems with automatic diagnosis of faults,” Avtomat. i Telemekhan., Vol. 26, No. 8 (1965).

    Google Scholar 

  2. M. V. Wilkes, “Design of practical self-repairing systems,” Control, Vol. 4, No. 40 (1961).

    Google Scholar 

  3. J. von Neumann, “Probabilistic logics and the synthesis of reliable organisms from unreliable components,” in Automata Studies, (eds. C. E. Shannon and J. McCarthy), Princeton University Press, Princeton (1956).

    Google Scholar 

  4. L. A. M. Verbeek, “On error minimizing neuronal nets,” in: Principles of Self-Organization, Pergamon Press (1962).

    Google Scholar 

  5. I. D. Cowan, “Many-valued logics and reliable automata,” in: Principles of Self-Organization, Pergamon Press (1962).

    Google Scholar 

  6. E. Moore and C. Shannon, “Reliable circuits using less reliable relays,” J. of the Franklin Inst., No. 3 (1956); No. 4 (1956).

    Google Scholar 

  7. A. A. Mullin, “Reliable stochastic sequential switching circuits,” Commun. and Electr., No. 39 (1958).

    Google Scholar 

  8. P. Elias, “Computation in the presence of noise,” IBM J. Res. and Develop., Vol. 2 (1958).

    Google Scholar 

  9. A. D. Zakrevskii, “Method of synthesizing functionally stable automata,” Dokl. Akad. Nauk SSSR, Vol. 129, No. 4 (1959).

    Google Scholar 

  10. J. Tooley, “Network coding for reliability,” Commun. and Electr., No. 64 (1963).

    Google Scholar 

  11. D. B. Armstrong, “A general method of applying error correction to synchronous digital systems,” Bell System Tech. Journal, Vol. 40, No. 2 (1961).

    Google Scholar 

  12. M. A. Gavrilov, “Structural redundancy and reliability of operation of relay devices,” in: Proceedings of the First IFAC Congress, Vol. 3, Izd. Akad. Nauk SSSR, (1961).

    Google Scholar 

  13. W. W. Peterson, Error-Correcting Codes, Wiley, Cambridge (1961).

    Google Scholar 

  14. S. H. Caldwell, Switching Circuits and Logical Design, Wiley, New York (1958).

    Google Scholar 

  15. A. M. Polovko, Fundamentals of Reliability Theory, Izd. “Nauka” (1964).

    Google Scholar 

  16. B. V Gnedenko, Course in Probability Theory, Izd. “Nauka” (1965).

    Google Scholar 

  17. V. B. Davenport and V. L. Root, Introduction to the Theory of Random Signals and Noise, McGraw-Hill, New York, New York (1958).

    Google Scholar 

  18. P. Elias, “Coding in real communications systems,” [Russian translation from English], in: Cybernetics Collection, No. 4, IL (1962).

    Google Scholar 

  19. V. G. Lazarev and E. I. Piil’, Synthesis of Asynchronous Finite Automata, Izd. “Nauka” (1964).

    Google Scholar 

  20. E. N. Turuta, “On the question of structural redundancy in constructing type B automata with given reliability,” in: Information Transmission Networks and Their Automation, Izd. “Nauka” (1965).

    Google Scholar 

  21. M. E. Tylkin, “On realizations of distance matrices in unit cubes,” in: Problems of Cybernetics, Vol. 7 (1962).

    Google Scholar 

  22. D. Slepian, “A class of binary signalling alphabets,” Bell System Tech. J. Vol. 35 (1957).

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1969 Consultants Bureau, New York

About this chapter

Cite this chapter

Turuta, E.N. (1969). Some Methods of Increasing the Reliability of Finite Automata. In: Lazarev, V.G., Zakrevskii, A.V. (eds) Synthesis of Digital Automata / Problemy Sinteza Tsifrovykh Avtomatov / Проƃлемы Синтеза Цифровых Автоматов. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-9033-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-9033-6_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-9035-0

  • Online ISBN: 978-1-4684-9033-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics