Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
General Fuzzy Finite Switchboard Automata
View through CrossRef
The constructions of finite switchboard state automata are known to be an extension of finite automata in the view of commutative and switching state machines. This research incorporated an idea of a switchboard in the general fuzzy automata to introduce general fuzzy finite switchboard automata. The attained output reveals that a strongly connected general fuzzy finite switchboard automaton is equivalent to the retrievable general fuzzy automata. Further, the notion of the switchboard subsystem and strong switchboard subsystem of general fuzzy finite switchboard automata are examined. Finally, the concept of fuzzy topology on general fuzzy finite switchboard automata in terms of these characterisations is formulated.
World Scientific Pub Co Pte Lt
Title: General Fuzzy Finite Switchboard Automata
Description:
The constructions of finite switchboard state automata are known to be an extension of finite automata in the view of commutative and switching state machines.
This research incorporated an idea of a switchboard in the general fuzzy automata to introduce general fuzzy finite switchboard automata.
The attained output reveals that a strongly connected general fuzzy finite switchboard automaton is equivalent to the retrievable general fuzzy automata.
Further, the notion of the switchboard subsystem and strong switchboard subsystem of general fuzzy finite switchboard automata are examined.
Finally, the concept of fuzzy topology on general fuzzy finite switchboard automata in terms of these characterisations is formulated.
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...
General Fuzzy Switchboard Transformation Semigroup
General Fuzzy Switchboard Transformation Semigroup
Commutative and switching processing are central to computation. However, some problems arise when classical versions do not reflect the true needs of current computer science, whe...
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...
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...
Characterized Fuzzy R2.5 and Characterized Fuzzy T3.5 Spaces
Characterized Fuzzy R2.5 and Characterized Fuzzy T3.5 Spaces
This paper, deals with, introduce and study the notions of haracterized fuzzy R2.5 spaces and of characterized fuzzy T3.5 spaces by using the notion of fuzzy function family presen...
Simulations for Event-Clock Automata
Simulations for Event-Clock Automata
Event-clock automata (ECA) are a well-known semantic subclass of timed
automata (TA) which enjoy admirable theoretical properties, e.g.,
determinizability, and are practically usef...
ω – 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...