Deterministic Acceptors of Regular Fuzzy Languages
G. Michael, Peter N. Marinos · IEEE Transactions on Systems Man and Cybernetics · 1974
The one-to-one relationship between finite automata, regular (type-3) languages, and regular expressions is well known. This correspondence demonstrates the use of regular expressions for describing deterministically finite fuzzy automata and regular fuzzy languages, and introduces a normal form for the production of a regular fuzzy grammar when the ``max(min)'' rule is used.