24 November 2020 in IEEE Transactions on Fuzzy Systems
In this paper, we define λ-approximate simulations and bisimulations for fuzzy automata over complete Heyting algebras. The value λ presents the degree of language similarity or equality between observed fuzzy automata. Algorithms for computing the greatest λ-approximate simulations and bisimulations are given. We show that λ-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 same minimal corresponding factor fuzzy automata.
1 May 2018 in Fuzzy Sets and Systems
9 May 2022 in Fuzzy Sets and Systems
1 December 2018 in Information Sciences
18 January 2023 in IEEE Transactions on Fuzzy Systems
We introduce fuzzy minimax nets as a novel tool to compute the greatest fuzzy bisimulation/simulation between two finite fuzzy labeled graphs. Fuzzy labeled graphs are a universal data structure for representing fuzzy systems such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke models, fuzzy social networks and fuzzy interpretations in description logic. The greatest fuzzy bisimulation between two such systems characterizes the similarity between their states, actors or individuals. Using fuzzy minimax nets, we design the first algorithms for the mentioned computational problems in the case of using the product t-norm, as well as the first algorithms whose complexity order does not depend on the fuzzy values occurring in the inputs for those problems in the case of using the Łukasiewicz t-norm.
1 January 2019 in Filomat
We define right and left invariant matrices as Boolean matrices that are solutions to certain systems of matrix equations and inequalities over additively idempotent semirings. We provide improved algorithms for computing the greatest right and left invariant equivalence and quasi-order matrices. The improvements are based on the usage of the well-known partition refinement technique. Afterwards, we present the application of right invariant matrices in the determinization of weighted automata over additively idempotent, commutative and zero-divisor free semirings. In particular, we provide improvements of the well-known determinization method of weighted automata over tropical semirings given by Mohri [Computational Linguistics 23 (2) (1997) 269-311].