Abstract
The purpose of the present work is to provide a simpler solution of a well-known characterization of fuzzy regular languages and a minimal realization for given fuzzy language by using Brzozowski’s algorithm. In between, we associate two crisp deterministic fuzzy automata with a given crisp deterministic fuzzy automaton and show that the reachability and observability maps of the given crisp deterministic fuzzy automaton turn out to be morphisms of category of all crisp deterministic fuzzy automata.
Keywords
Get full access to this article
View all access options for this article.
