1. Istituto Matematico, Facoltà di Architettura, Università di Napoli , Napoli, Italy;2. Department of Automatic Control and Computer Science , Silesian Technical University , Gliwice, Poland
Abstract:
The paper deals with a problem of decomposition of a binary fuzzy relation defined in the Cartesian product of a finite space. We propose an algorithm which produces the decomposition or indicates that the given relation is non-decomposable, within a finite sequence of steps.