摘要

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 Stamenkovie irie's method (Stamenkovie and Ciri (2012)[11]), is recognized by a fuzzy finite automaton with epsilon-moves. Every fuzzy automaton with epsilon-moves is also equivalent to a fuzzy automaton and there are effective methods for removing epsilon-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 epsilon-moves for the fuzzy regular expression and the construction of an equivalent fuzzy finite automaton by means of epsilon-removal operation.

  • 出版日期2015-3-1

全文