On the recognizability of fuzzy languages II
It is shown that a fuzzy language is recognized by a finite monoid iff it has finitely many right derivatives iff it has finitely many left derivatives. Finally we show that the behaviors of Lukasiewicz automata have the above properties. (c) 2007 Elsevier B.V. All rights reserved.
fuzzy automata