Approximate bisimulations for fuzzy automata have recently drawn attention of researches,
since they allow to correlate different fuzzy automata which behave equivalently only to the …

In this article, we define $\lambda$ -approximate simulations and bisimulations for fuzzy
automata over complete Heyting algebras. The value $\lambda$ presents the degree of …

Abstract Systems of fuzzy relation equations and inequalities in which an unknown fuzzy
relation is on the one side of the equation or inequality are linear systems. They are the most …

In this article, 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 …

Simulations and bisimulations are well-established notions in crisp/fuzzy automata theory
and are widely used to compare the behaviors of automata. Their main drawback is that they …

Right invariant fuzzy quasi-orders for fuzzy automata are broadly studied in the recent
literature, as they arise as solutions to particular systems of fuzzy relation equations and …

Determinization of fuzzy finite automata is understood here as a procedure of their
conversion into equivalent crisp-deterministic fuzzy automata, which can be viewed as being …

In this paper we provide further improvements of determinization methods for fuzzy finite
automata. These methods perform better than all previous determinization methods for fuzzy …

The problem of aggregating large fuzzy relational structures is of major importance. One of
the main issues is seeking a simpler fuzzy relational structure, while keeping the structure …

Two types of simulations and four types of bisimulations for weighted finite automata over
the complete max-plus semiring we define as solutions of particular systems of matrix …