Fault Tolerant Sequential Mackines

IEEE Transactions on Computers

Volumn C-20, Issue 10, 1971, Pages 1167-1177

  Meyer, John F ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Error correcting codes; fault tolerance; redundancy; reliable automata; sequential machines

Indexed keywords

AUTOMATA THEORY;

EID: 0015143949     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1971.223101     Document Type: Article

References (11)

1. M. A. Harrison, “An analysis of errors in finite automata,” Inform. Contr., vol. 8, Aug. 1965, pp. 430–450.
2. P. G. Neumann, “Error-limiting coding using information-lossless machines,” IEEE Trans. Inform. Theory, vol. IT-10, Apr. 1964, pp. 108–115.
3. S. Winograd, “Input error limiting automata,” J. Ass. Comput. Mach., vol. 11,.July 1964, pp. 338–351.
4. P. S. Dauber, “An analysis of errors in finite automata,” Inform. Contr., vol. 8, June 1965, pp. 295–303.
5. J. Hartmanis and R. E. Stearns, “A study of feedback and errors in sequential machines,” IEEE Trans. Electron. Comput., vol. EC-12, June 1963, pp. 223–332.
6. J. F. Meyer, “On the structure of fault tolerant sequential machines,” in Proc. 3rd Hawaii Int. Conf. Syst. Sci. (Part I), Jan. 1970, pp. 443–447.
7. R. L. Russo, “Synthesis of error-tolerant counters using minimum distance three state assignments,” IEEE Trans. Electron. Comput., vol. EC-14, June 1965, pp. 359–366.
8. A. H. Clifford and G. B. Preston, The Algebraic Theory of Semi groups, vol. I. Providence, R. I.: Amer. Math. Soc., 1961.
9. J. Sequential Hartmanis and R. E. Stearns, Algebraic Structure Theory of Sequential Machines. Englewood Cliffs, N. J.: Prentice-Hall, 1966.
10. J. von Neumann, “Probabilistic logics and the synthesis of reliable organisms from unreliable components,” in Automata Studies (Annals of Mathematics Studies, no. 34). Princeton, N. J.: Princeton Univ. Press, 1956.
11. W. W. Peterson, Error-Correcting Codes. New York: Wiley and Cambridge, Mass.: M.I.T. Press, 1961.