In this paper, we introduce the concept of fuzzy regular language and show that if L is a fuzzy regular language, then every a - cut La (a ∈ (0, 1]) is a regular language. We also give a characterization of fuzzy regular languages.
Monoid, Non deterministic automaton, equivalence class, fuzzy regular language, fuzzy automaton