Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata (Q1115194)

Finite fuzzy automata over a bounded chain (\({\mathbb{L}}\)-automata) are studied. The (new and very important) notions of approximative (\(\epsilon\)-)equivalence, reduction and minimization for \({\mathbb{L}}\)- automata are introduced and the analogues of some classical results are obtained (see Theorems 4, 5, 7, 8 as well as Algorithms B, E, P). As a necessary new technique the solvability conditions for systems of linear equations over the chain \({\mathbb{L}}\) are formulated (an analogue of the Kronecker-Capelli theorem) and the corresponding algorithm is described (see Theorem 2 and Algorithm I).