Anzeige
Erschienen in:
14.03.2019 | Foundations
Bisimulation of type 2 for BL-general fuzzy automata
Erschienen in: Soft Computing | Ausgabe 20/2019
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
In this note, first, we define bisimulation of type 2 for a basic logic general fuzzy automaton and show that if there exists a bisimulation of type 2 between two basic logic general fuzzy automata, then they have the same behavior.
Also, by using the greatest bisimulation of type 2, we obtain a quotient basic logic general fuzzy automaton in which this quotient is minimal. Moreover, we prove that if there exists a bisimulation of type 1 between two automata, then there is a bisimulation of type 2 between them, but the converse is not valid.
Moreover, we give an algorithm, which determines the bisimulation of type 2 between any two basic logic general fuzzy automata and show that the time complexity of this algorithm is so better than the time complexity of the algorithm computing bisimulation of type 1. After that, we present some examples to clarify the notions and results of this paper.