Parallel Fuzzy Regular Expression and its Conversion to Epsilon-Free Fuzzy Automaton

摘要

Inspired by the applications of fuzzy automata and parallel regular expressions, we propose a new mathematical concept of parallel fuzzy regular expressions. In this paper, we investigate the equivalence between parallel fuzzy regular expressions and parallel fuzzy finite automata. An algorithm is proposed for carrying out the conversion of parallel fuzzy regular expressions to ε-free non-deterministic fuzzy automata. Furthermore, an analysis of the number of states obtained in the fuzzy automaton will be carried out using the proposed algorithm. Finally, the proposed algorithm is illustrated by a numerical example.