Back to Search
Start Over
General Fuzzy Finite Switchboard Automata
- Source :
- New Mathematics and Natural Computation. 15:283-305
- Publication Year :
- 2019
- Publisher :
- World Scientific Pub Co Pte Lt, 2019.
-
Abstract
- 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.
- Subjects :
- TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES
Finite-state machine
Mathematics::General Mathematics
Computer science
Applied Mathematics
010102 general mathematics
Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)
Extension (predicate logic)
Nonlinear Sciences::Cellular Automata and Lattice Gases
01 natural sciences
Fuzzy logic
Computer Science Applications
Automaton
010101 applied mathematics
Human-Computer Interaction
Algebra
Computational Mathematics
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Computational Theory and Mathematics
Homomorphism
State (computer science)
0101 mathematics
Commutative property
Computer Science::Formal Languages and Automata Theory
Topology (chemistry)
Subjects
Details
- ISSN :
- 17937027 and 17930057
- Volume :
- 15
- Database :
- OpenAIRE
- Journal :
- New Mathematics and Natural Computation
- Accession number :
- edsair.doi...........11dce8c9379fe90a57f3b429a7199d1f