Fuzzy finite switchboard automata with complete residuated lattices

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

Full text not available from this repository. (Request a copy)


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.

Item Type: Article
Uncontrolled Keywords: Complete Residuated Lattices; Fuzzy Finite Automata; Fuzzy Finite Switchboard Automata; Switchboard Subsystems.
Subjects: Q Science > QA Mathematics > QA1-43 General
T Technology > T Technology (General) > T55.4-60.8 Industrial engineering. Management engineering > T57-57.97 Applied mathematics. Quantitative methods > T57.6-57.97 Operations research. Systems analysis
Divisions: Faculty of Applied Science and Technology > Department of Mathematics and Statistics
Depositing User: UiTM Student Praktikal
Date Deposited: 24 Nov 2021 08:35
Last Modified: 24 Nov 2021 08:35
URI: http://eprints.uthm.edu.my/id/eprint/4081

Actions (login required)

View Item View Item