Abstract :
For finite L-fuzzy machines we develop behaviour, reduction and minimization theory. Here L stands for (L, V, (lambda), 0,1), where L is a totally ordered set with universal bounds 0 and 1 and the operations are join V and meet (lambda). The most essential results include investigating behaviour, equivalence, reduction and minimization problems and their algorithmical decidability.
