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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
