A comment on Construction of fuzzy automata from fuzzy regular expressions
The aim of this comment is to point out that the fuzzy language recognized by a nondeterministic finite automaton, which is associated with a fuzzy regular expression, in the context of Stamenkovi??iri?'s method (Stamenkovi? and ?iri? (2012) [11]), is recognized by a fuzzy finite automaton with ?-moves. Every fuzzy automaton with ?-moves is also equivalent to a fuzzy automaton and there are effective methods for removing ?-moves in order to obtain the equivalent fuzzy automaton. In this way, our proposal to convert a fuzzy regular expression to a fuzzy finite automaton is based on the construction of a fuzzy automaton with ?-moves for the fuzzy regular expression and the construction of an equivalent fuzzy finite automaton by means of ?-removal operation.
fuzzy automata fuzzy regular expressions ?-removal operation fuzzy automata with ?-moves position automata lattice-ordered monoids