Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-03-25
Computer Science
Formal Languages and Automata Theory
19 pages, submitted to a journal
Scientific paper
Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, and backward-forward bisimulations) between fuzzy automata have been introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of this kind. In the present paper, for any of the above-mentioned types of simulations/bisimulations we provide an effective algorithm for deciding whether there is a simulation/bisimulation of this type between the given fuzzy automata, and for computing the greatest one, whenever it exists. The algorithms are based on the method developed in [J. Ignjatovi\'c, M. \'Ciri\'c, S. Bogdanovi\'c, On the greatest solutions to certain systems of fuzzy relation inequalities and equations, Fuzzy Sets and Systems 161 (2010) 3081-3113], which comes down to the computing of the greatest post-fixed point, contained in a given fuzzy relation, of an isotone function on the lattice of fuzzy relations.
Ćirić Miroslav
Damljanović Nada
Ignjatović Jelena
Jančić Ivana
No associations
LandOfFree
Algorithms for computing the greatest simulations and bisimulations between fuzzy automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Algorithms for computing the greatest simulations and bisimulations between fuzzy automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for computing the greatest simulations and bisimulations between fuzzy automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-223295