Title :
Deterministic Acceptors of Regular Fuzzy Languages
Author :
Thomason, Michael G. ; Marinos, Peter N.
Author_Institution :
Computer Science Department, University of Tennessee, Knoxville, Tenn.
fDate :
3/1/1974 12:00:00 AM
Abstract :
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.
Keywords :
Automata; Costs; Doped fiber amplifiers; Fuzzy logic; Fuzzy sets; Mathematics; Pattern recognition; Production; Solids; Stochastic processes;
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
DOI :
10.1109/TSMC.1974.5409123
