Abstract
A treatment of modifiable, finite automata based on the concepts of tolerance spaces and fuzrelations is given. The performance of a modification of an automaton is compared with that of its reference automaton by means of a suitable comparison relation. Relations between modifiable, time-variant, and learning automata are outlined, and the modification masking capacity of certain automata with given tolerance is investigated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Poincaré,The Value of Science (1913; reprinted by Dover, New York, 1958, p. 37).
M. Dal Cin, “Modifiable automata and learning,” preprint, Tübingen (1974).
A. Salomaa, “On finite automata with a time-variant structure,”Inf. Control 13:85–98 (1968).
J. Tou and R. Wilcox,Computer and Information Sciences (Spartan Books. Washington, D.C., 1964).
T. Poston, “Fuzzy geometry,” Doct. Thesis, University of Warwick (1971).
M. Dal Cin, “Fuzzy-state automata: Their stability and fault-tolerance,” this issue, preceding paper.
J. F. Meyer, “Fault-tolerant sequential machines,”IEEE Trans. Computers C-20:1167 1177 (1971).
M. Dal Cin, “Modifiable automata with tolerance,” preprint, Tübingen (1973); to appear inProc. Int. Summer School on the Mathematics and Physics of the Nervous System, Miramare, Italy, 1973 (Springer Verlag).
M. A. Arbib, “Tolerance automata,”Kybernetica 3:223–233 (1967).
B. M. Schein, “Relation algebras and function semigroups,”Semigroup Forum 1:1–62 (1970).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dal Cin, M. Modification tolerance of fuzzy-state automata. International Journal of Computer and Information Sciences 4, 81–93 (1975). https://doi.org/10.1007/BF00976220
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00976220