Cover Image

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, whereby they cannot predict the flow of the next input information in the specified output. The Switchboard State Machine i...

Full description

Saved in:
Bibliographic Details
Main Authors: Ebas, Nur Ain, Jacob, Kavikumar, Rusiman, Mohd Saifullah, Shaf, Muhammad Ammar, Deivanayagampilla, Nagarajan
Format: Article
Language:English
Published: semarak ilmu 2024
Subjects:
QA Mathematics
Online Access:http://eprints.uthm.edu.my/12014/1/J17641_f29030d5b050961ef28031bdcfd3c03c.pdf
http://eprints.uthm.edu.my/12014/
https://doi.org/10.37934/araset.42.2.112
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uthm.eprints.12014
record_format eprints
spelling my.uthm.eprints.120142025-01-27T02:01:46Z http://eprints.uthm.edu.my/12014/ General Fuzzy Switchboard Transformation Semigroup Ebas, Nur Ain Jacob, Kavikumar Rusiman, Mohd Saifullah Shaf, Muhammad Ammar Deivanayagampilla, Nagarajan QA Mathematics 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, whereby they cannot predict the flow of the next input information in the specified output. The Switchboard State Machine is a controller that controls the direct flow of information from one state to another and also plays the main part in communication between the subsystems. If the simple system satisfies the two properties of the switching and commutative state machines, the system is therefore a finite switchboard state machine. The general fuzzy switchboard automation (GFSA) was introduced by incorporating the switchboard into the general fuzzy automation. This paper is intended to introduce the concept of a general fuzzy switchboard transformation semigroup (GFSTS) by combining the GFSA and the transformation semigroup. Some related definitions and properties are established. The example of certain products, such as GFSTS cascade products, has also been studied. General Fuzzy Switchboard Poly Transformation Semigroup (GFSPS) is also introduced since it fulfils the switchboard state machine properties. Some of the definitions and properties associated with the GFSPS are defined. Applications for general fuzzy switchboard automata, such as washing machines, are also provided. semarak ilmu 2024 Article PeerReviewed text en http://eprints.uthm.edu.my/12014/1/J17641_f29030d5b050961ef28031bdcfd3c03c.pdf Ebas, Nur Ain and Jacob, Kavikumar and Rusiman, Mohd Saifullah and Shaf, Muhammad Ammar and Deivanayagampilla, Nagarajan (2024) General Fuzzy Switchboard Transformation Semigroup. Journal of Advanced Research in Applied Sciences and Engineering Technology, 42 (2). pp. 1-12. ISSN 2462-1943 https://doi.org/10.37934/araset.42.2.112
institution Universiti Tun Hussein Onn Malaysia
building UTHM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Tun Hussein Onn Malaysia
content_source UTHM Institutional Repository
url_provider http://eprints.uthm.edu.my/
language English
topic QA Mathematics
spellingShingle QA Mathematics
Ebas, Nur Ain
Jacob, Kavikumar
Rusiman, Mohd Saifullah
Shaf, Muhammad Ammar
Deivanayagampilla, Nagarajan
General Fuzzy Switchboard Transformation Semigroup
description 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, whereby they cannot predict the flow of the next input information in the specified output. The Switchboard State Machine is a controller that controls the direct flow of information from one state to another and also plays the main part in communication between the subsystems. If the simple system satisfies the two properties of the switching and commutative state machines, the system is therefore a finite switchboard state machine. The general fuzzy switchboard automation (GFSA) was introduced by incorporating the switchboard into the general fuzzy automation. This paper is intended to introduce the concept of a general fuzzy switchboard transformation semigroup (GFSTS) by combining the GFSA and the transformation semigroup. Some related definitions and properties are established. The example of certain products, such as GFSTS cascade products, has also been studied. General Fuzzy Switchboard Poly Transformation Semigroup (GFSPS) is also introduced since it fulfils the switchboard state machine properties. Some of the definitions and properties associated with the GFSPS are defined. Applications for general fuzzy switchboard automata, such as washing machines, are also provided.
format Article
author Ebas, Nur Ain
Jacob, Kavikumar
Rusiman, Mohd Saifullah
Shaf, Muhammad Ammar
Deivanayagampilla, Nagarajan
author_facet Ebas, Nur Ain
Jacob, Kavikumar
Rusiman, Mohd Saifullah
Shaf, Muhammad Ammar
Deivanayagampilla, Nagarajan
author_sort Ebas, Nur Ain
title General Fuzzy Switchboard Transformation Semigroup
title_short General Fuzzy Switchboard Transformation Semigroup
title_full General Fuzzy Switchboard Transformation Semigroup
title_fullStr General Fuzzy Switchboard Transformation Semigroup
title_full_unstemmed General Fuzzy Switchboard Transformation Semigroup
title_sort general fuzzy switchboard transformation semigroup
publisher semarak ilmu
publishDate 2024
url http://eprints.uthm.edu.my/12014/1/J17641_f29030d5b050961ef28031bdcfd3c03c.pdf
http://eprints.uthm.edu.my/12014/
https://doi.org/10.37934/araset.42.2.112
_version_ 1823094302446714880
score 13.235796

Similar Items