Javascript must be enabled to continue!
Isotone Galois connections in LB-valued general fuzzy automata
View through CrossRef
The present study aimed at investigating the interior and closure operators which have been characterized by isotone Galois connections between posets/finite upper semilattices associated with an LB-valued general fuzzy automaton (for simplicity LBvalued GFA). In addition, the existence of isotone Galois connections between different pairs of posets/finite upper semlattices associated with a given LB-valued GFA was examined and explicated in detail. The properties of isotone Galois connections were also discussed under some conditions imposed on LB-valued GFA. Further, the decomposition of an LB-valued general fuzzy automaton was defined and a subautomaton of an LB-valued GFA was characterized in terms of its decomposition components. We have also demonstrated that the cardinality of set of all subautomata of an LB-valued general fuzzy automaton is not equal to sum of cardinalities of set of all subautomata of finite decomposition components.
KMAN Publication Incorporation
Title: Isotone Galois connections in LB-valued general fuzzy automata
Description:
The present study aimed at investigating the interior and closure operators which have been characterized by isotone Galois connections between posets/finite upper semilattices associated with an LB-valued general fuzzy automaton (for simplicity LBvalued GFA).
In addition, the existence of isotone Galois connections between different pairs of posets/finite upper semlattices associated with a given LB-valued GFA was examined and explicated in detail.
The properties of isotone Galois connections were also discussed under some conditions imposed on LB-valued GFA.
Further, the decomposition of an LB-valued general fuzzy automaton was defined and a subautomaton of an LB-valued GFA was characterized in terms of its decomposition components.
We have also demonstrated that the cardinality of set of all subautomata of an LB-valued general fuzzy automaton is not equal to sum of cardinalities of set of all subautomata of finite decomposition components.
Related Results
FUZZY‐FUZZY AUTOMATA
FUZZY‐FUZZY AUTOMATA
Based on the concept of fuzzy sets of type 2 (or fuzzy‐fuzzy sets) defined by L. A. Zadeh, fuzzy‐fuzzy automata ate newly formulated and some properties of these automata are inves...
Constructive Galois connections: taming the Galois connection framework for mechanized metatheory
Constructive Galois connections: taming the Galois connection framework for mechanized metatheory
Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of ...
Epsilon-removal constructions of fuzzy finite automata based on fuzzy matrices
Epsilon-removal constructions of fuzzy finite automata based on fuzzy matrices
Abstract
The equivalence of different forms of automata provides a lot of convenience for us to solve practical problems. Sometimes, for efficient use of a fuzzy finite aut...
Some Connectivity Parameters of Interval-Valued Intuitionistic Fuzzy Graphs with Applications
Some Connectivity Parameters of Interval-Valued Intuitionistic Fuzzy Graphs with Applications
Connectivity in graphs is useful in describing different types of communication systems like neural networks, computer networks, etc. In the design of any network, it is essential ...
Constructive Galois Connections
Constructive Galois Connections
Abstract
Galois connections are a foundational tool for structuring abstraction in semantics, and their use lies at the heart of the theory o...
Konstruksi Sistem Inferensi Fuzzy Menggunakan Subtractive Fuzzy C-Means pada Data Parkinson
Konstruksi Sistem Inferensi Fuzzy Menggunakan Subtractive Fuzzy C-Means pada Data Parkinson
Abstract. Fuzzy Inference System requires several stages to get the output, 1) formation of fuzzy sets, 2) formation of rules, 3) application of implication functions, 4) compositi...
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Here in this paper, we provide characterizations of fuzzy quasi-ideal in terms of level and strong level subsets. Along with it, we provide expression for the generated fuzzy quasi...
ω – SUBSEMIRING FUZZY
ω – SUBSEMIRING FUZZY
Mapping ρ is called a fuzzy subset of an empty set of S if ρ is the mapping from S to the closed interval [0,1]. A fuzzy subset ρ introduced into this paper is a fuzzy subset of se...

