On the theory of signature analyzers
Indexed on: 01 Mar '90Published on: 01 Mar '90Published in: Cybernetics and Systems Analysis
Abstract
An outputless linear sequential machine with zero initial state is used as the mathematical model of a signature analyzer (SA). The main properties of the SA are examined and a criterion of undetectability of an arbitrary set of errors by some SA is derived.
