LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Approximate Bisimulations for Fuzzy Automata Over Complete Heyting Algebras

Photo by rainierridao from unsplash

In this article, we define $\lambda$-approximate simulations and bisimulations for fuzzy automata over complete Heyting algebras. The value $\lambda$ presents the degree of language similarity or equality between observed fuzzy… Click to show full abstract

In this article, we define $\lambda$-approximate simulations and bisimulations for fuzzy automata over complete Heyting algebras. The value $\lambda$ presents the degree of language similarity or equality between observed fuzzy automata. Algorithms for computing the greatest $\lambda$-approximate simulations and bisimulations are given. We show that $\lambda$-approximate simulations and bisimulations on a fuzzy automaton can be effectively used for factorization of fuzzy automata. We present the algorithm that splits the interval of the degrees of language similarity or equality into subintervals with the same minimal corresponding factor fuzzy automata.

Keywords: fuzzy automata; inline formula; bisimulations fuzzy; tex math

Journal Title: IEEE Transactions on Fuzzy Systems
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.