Bisimulations have been widely used in many areas of computer science to model
equivalence between various systems, and to reduce the number of states of these systems …

Weakly linear systems of fuzzy relation inequalities and equations have recently emerged
from research in the theory of fuzzy automata. From the general aspect of the theory of fuzzy …

Recently, two types of simulations (forward and backward simulations) and four types of
bisimulations (forward, backward, forward–backward, and backward–forward bisimulations) …

We show that the state reduction problem for fuzzy automata is related to the problem of
finding a solution to a particular system of fuzzy relation equations in the set of all fuzzy …

In this paper we study systems of fuzzy relation inequalities and equations of the form U∘
Vi≤ Vi∘ U (i∈ I), where U is an unknown and Vi (i∈ I) are given fuzzy relations, the dual …

In this note, we define BISIMULATION for GENERAL FUZZY AUTOMATA/fa? page= 1&sort=
1&ftyp= all&fgrp= all&fyrs= all" target=" _blank"> BL-GENERAL FUZZY AUTOMATA and …

We improve on an existing [PA Abdulla, J. Högberg, L. Kaati, Bisimulation minimization of
tree automata, International Journal of Foundations of Computer Science 18 (4)(2007) 699 …

We address the problem of computing simulation relations over tree automata. In particular,
we consider downward and upward simulations on tree automata, which are, loosely …

Forward and backward bisimulations have been introduced recently by Ćirić et al.(2012)[9]
as a means for modeling the equivalence between states of fuzzy automata and …

In this paper we study the equivalence of nondeterministic automata pairing the concept of a
bisimulation with the recently introduced concept of a uniform relation. In this symbiosis …