Conversion of fuzzy automata into fuzzy regular expressions using transitive closure

Article type: Research Article

Authors: Garhwal, Sunita^{a; *} | Jiwari, Ram^b

Affiliations: [a] Department of Computer Science and Engineering, Thapar University, Patiala, India | [b] Deparment of Mathematics, Indian Institute of Technology, Roorkee, India

Correspondence: [*] Corresponding author. Sunita Garhwal, Department of Computer Science and Engineering, Thapar University, Patiala, India. Tel./Fax: +919780081424; E-mail: [email protected].

Abstract: The concept of transitive closure is useful for the conversion of classical finite automata into regular expressions. In this paper, we generalize and extend the concept of transitive closure for the conversion of fuzzy automata into fuzzy regular expressions. We prove that, for a fuzzy automaton M where r is a fuzzy regular expression obtained using the proposed approach, L(M)=L(r). Finally, a numerical example illustrates this conversion.

Keywords: Fuzzy regular expression, fuzzy automata, integral lattice monoid, transitive closure

DOI: 10.3233/IFS-152038

Journal: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 6, pp. 3123-3129, 2016