This is a preview of subscription content, log in via an institution to check access.
References
J. E. Smith, “Measure of effectiveness of fault signature analysis, IEEE Trans. Comput., C-29, No. 6, 510–514 (1980).
A. N. Efimov and E. V. Luk-Zil’berman, “A class of automata performing signature analyzer functions,” Avtomat. Telemekh., No. 1, 127–135 (1988).
A. S. Barashko, “Asymptotic optimality of linear signature analyzers with respect to stationary errors,” Kibern. Sist. Anal., No. 5, 178–181 (1993).
M. Damiani, P. Olivo, and B. Ricco, “Analysis and design of linear finite state machines for signature analysis testing,” IEEE Trans. Comput., C-40, No. 9, 1034–1045 (1991).
A. S. Barashko, “Toward a theory of signature analyzers,” Kibernetika, No. 2, 18–22 (1990).
J. Kemeny and J. Snell, Finite Markov Chains [Russian translation], Nauka, Moscow (1970).
F. R. Gantmakher, Matrix Theory [in Russian], Nauka, Moscow (1966).
A. Gill, Linear Sequential Machines [Russian translation], Nauka, Moscow (1971).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 48–57, September–October, 1995.
Rights and permissions
About this article
Cite this article
Barashko, A.S. Dependence of asymptotic optimality of signature analyzers on error distribution. Cybern Syst Anal 31, 675–681 (1995). https://doi.org/10.1007/BF02366315
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02366315