Fuzzy finite switchboard automata with complete residuated lattices
The theory of fuzzy finite switchboard automata (FFSA) is introduced by the use of general algebraic structures such as complete residuated lattices in order to enhance the process ability of FFSA. We established the notion of homomorphism, strong homomorphism and reverse homomorphism and shows some...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Science Publishing Corporation
2018
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/4081/ |
| _version_ | 1848888190843224064 |
|---|---|
| author | Ebas, Nur Ain Amir Hamzah, Nor Shamsidah Jacob, Kavikumar Rusiman, Mohd Saifullah |
| author_facet | Ebas, Nur Ain Amir Hamzah, Nor Shamsidah Jacob, Kavikumar Rusiman, Mohd Saifullah |
| author_sort | Ebas, Nur Ain |
| building | UTHM Institutional Repository |
| collection | Online Access |
| description | The theory of fuzzy finite switchboard automata (FFSA) is introduced by the use of general algebraic structures such as complete residuated lattices in order to enhance the process ability of FFSA. We established the notion of homomorphism, strong homomorphism and reverse homomorphism and shows some of its properties. The subsystem of FFSA is studied and the set of switchboard subsystemforms a complete ℒ -sublattices is shown. The algorithm of FFSA with complete residuated lattices is given and an example is provided. |
| first_indexed | 2025-11-15T20:06:21Z |
| format | Article |
| id | uthm-4081 |
| institution | Universiti Tun Hussein Onn Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T20:06:21Z |
| publishDate | 2018 |
| publisher | Science Publishing Corporation |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | uthm-40812021-11-24T08:35:41Z http://eprints.uthm.edu.my/4081/ Fuzzy finite switchboard automata with complete residuated lattices Ebas, Nur Ain Amir Hamzah, Nor Shamsidah Jacob, Kavikumar Rusiman, Mohd Saifullah QA1-43 General T57.6-57.97 Operations research. Systems analysis The theory of fuzzy finite switchboard automata (FFSA) is introduced by the use of general algebraic structures such as complete residuated lattices in order to enhance the process ability of FFSA. We established the notion of homomorphism, strong homomorphism and reverse homomorphism and shows some of its properties. The subsystem of FFSA is studied and the set of switchboard subsystemforms a complete ℒ -sublattices is shown. The algorithm of FFSA with complete residuated lattices is given and an example is provided. Science Publishing Corporation 2018 Article PeerReviewed Ebas, Nur Ain and Amir Hamzah, Nor Shamsidah and Jacob, Kavikumar and Rusiman, Mohd Saifullah (2018) Fuzzy finite switchboard automata with complete residuated lattices. International Journal of Engineering and Technology, 7 (4.3). pp. 160-164. ISSN 2227-524X |
| spellingShingle | QA1-43 General T57.6-57.97 Operations research. Systems analysis Ebas, Nur Ain Amir Hamzah, Nor Shamsidah Jacob, Kavikumar Rusiman, Mohd Saifullah Fuzzy finite switchboard automata with complete residuated lattices |
| title | Fuzzy finite switchboard automata with complete residuated lattices |
| title_full | Fuzzy finite switchboard automata with complete residuated lattices |
| title_fullStr | Fuzzy finite switchboard automata with complete residuated lattices |
| title_full_unstemmed | Fuzzy finite switchboard automata with complete residuated lattices |
| title_short | Fuzzy finite switchboard automata with complete residuated lattices |
| title_sort | fuzzy finite switchboard automata with complete residuated lattices |
| topic | QA1-43 General T57.6-57.97 Operations research. Systems analysis |
| url | http://eprints.uthm.edu.my/4081/ |