THE DECOMPOSITION OF TOLERANCE AUTOMATA
Allan Muir, M.W. Warner · Kybernetes · 1980
Tolerance automata are defined and a decomposition theory for such entities is sought. It is shown that two major procedures of the classical algebraic theory produce difficulties in the tolerance case. A weaker approach, employing the idea of inertial tolerance, is presented. Finally, an explicit example is given which illustrates both the difficulties encountered and the theorems proved in the text.