Skip to main content
Log in

Fuzzy-state automata: Their stability and fault tolerance

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

A unified treatment of stable behavior and fault tolerance of finite automata based on the concepts of tolerance spaces and fuzrelations is given. In particular, attractor sets of automata states, approximate fixed points, and almost periodicity of state transitions of finite automata are investigated.

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.

Similar content being viewed by others

References

  1. R. E. Kalman, P. L. Falb, and M. A. Arbib,Topics in Mathematical System Theory (McGraw-Hill, New York, 1969).

    Google Scholar 

  2. W. Brauer, “Zu den Grundlagen einer Theorie topologischer sequentieller Systeme und Automaten,”Gesellschaft für Mathematik und Datenverarbeitung, Bonn 1970 (31).

  3. T.G. Windeknecht,General Dynamical Processes, A Mathematical Introduction (Academic, New York, 1971).

    Google Scholar 

  4. H. Poincaré,The Value of Science (1913; reprinted by Dover, New York, 1958), p. 37.

  5. J. von Neumann, in A. W. Burks, ed.,Theory of Selfreproducing Automata (U. of Illinois Press, Urbana, Illinois) 1966.

    Google Scholar 

  6. E. C. Zeeman, in K. Fort, ed.,Topology of 3-Manifolds (Prentice-Hall, Englewood Cliffs, New Jersey, 1961), pp. 240–256.

    Google Scholar 

  7. T. Poston, “Fuzzy geometry,” Doct. Thesis, U. of Warwick (1971).

  8. M. A. Arbib, “Tolerance automata,”Kybernetika 3:223–233 (1967).

    Google Scholar 

  9. W. De Backer and L. Verbeek, Study of analog, digital and hybrid computers using automata theory,ICC Bulletin 5:215–244 (1966).

    Google Scholar 

  10. R. T. Yeh, “On the relational homomorphisms of automata,”Inf. Control 13:140–155 (1968).

    Google Scholar 

  11. A, Gill and J. R. Flexer, “Periodic decomposition of sequential machines,”J. Assoc. Comput. Mach. 14:666–676 (1967).

    Google Scholar 

  12. M. A. Harrison, “On the error correcting capacity of finite automata,”Inf. Control 8:430–450 (1965).

    Google Scholar 

  13. M. Dal Cin, “Modification tolerance of fuzzy-state automata,” this issue, following paper.

  14. J. Hartmanis and R. E. Stearns, “A study of feedback and errors in sequential machines,”IEEE Trans. Electron. Comput. EC-12:223–232 (1963).

    Google Scholar 

  15. P. S. Dauber, “An analysis of errors in finite automata,”Inf. Control 8:295–303 (1965).

    Google Scholar 

  16. T. Takaoka,in Proc. 3rd. Hawaii Int. Conf. Syst. Sci. (1970), pp. 76–79.

  17. S. Winograd, “Input error limiting automata,”J. Assoc. Comput. Mach. 11:338–351 (1964).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dal Cin, M. Fuzzy-state automata: Their stability and fault tolerance. International Journal of Computer and Information Sciences 4, 63–80 (1975). https://doi.org/10.1007/BF00976219

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation