Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Michael et al. (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: