THE DECOMPOSITION OF TOLERANCE AUTOMATA
Abstract
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.
Citation
MUIR, A. and WARNER, M.W. (1980), "THE DECOMPOSITION OF TOLERANCE AUTOMATA", Kybernetes, Vol. 9 No. 4, pp. 265-273. https://doi.org/10.1108/eb005563
Publisher
:MCB UP Ltd
Copyright © 1980, MCB UP Limited