Algebraic study of fuzzy finite switchboard automata

A finite switchboard automaton has an explicit mechanism which is switchboard that acts as a controller to predict the next input for the interaction within the systems. The classical version of the algebraic automata is a part of theoretical computer science which is not effectively reflecting the...

Full description

Saved in:

Bibliographic Details
Main Author:	Ebas, Nur Ain
Format:	Thesis
Language:	English English English
Published:	2020
Subjects:	TK7800-8360 Electronics
Online Access:	http://eprints.uthm.edu.my/1169/1/24p%20NUR%20AIN%20BINTI%20EBAS.pdf http://eprints.uthm.edu.my/1169/2/NUR%20AIN%20BINTI%20EBAS%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/1169/3/NUR%20AIN%20BINTI%20EBAS%20WATERMARK.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uthm-ep.1169
record_format	uketd_dc
spelling	my-uthm-ep.11692021-09-30T06:09:02Z Algebraic study of fuzzy finite switchboard automata 2020-11 Ebas, Nur Ain TK7800-8360 Electronics A finite switchboard automaton has an explicit mechanism which is switchboard that acts as a controller to predict the next input for the interaction within the systems. The classical version of the algebraic automata is a part of theoretical computer science which is not effectively reflecting the practical demands of the computation at the algebraic level. It unable to formalize the controller to predict the flow of the next input information into a designated output. In other words, the algebraic approach is still lacking in terms of their properties. Thus, it is necessary to understand the modeling of switching and commutative mechanisms as a controller in a machine. Fuzzy set theory can be applied to solve the control problems. This research studied on how one can incorporate the fuzzy set into finite switchboard automata and develop algebraic properties. Further, the general algebraic structure such as complete residuated lattices (CRL) has been utilized to enhance the membership grade of the fuzzy finite switchboard automata (FFSA). This research also proposed a specific algorithm for FFSA by the use of CRL. In an automata theory, some machines seldom have the possibility of overlapping transitions to the same state upon the same symbol from the different current states that are called as multi-memberships. Thus, this research considers the multi-memberships in the FFSA which lead to overcome these issues by introducing the theory of the general fuzzy switchboard automata (GFSA) and investigates the topological study of GFSA with the help of switchboard subsystems. The newly defined Kuratowski fuzzy closure operation is used to establish fuzzy topology on a GFSA. Semigroup actions are closely related to automata. By extending the algebraic properties of GFSA, the General Fuzzy Switchboard Transformation Semigroup (GFSTS) has been introduced and the concept of the covering and the products are established. The objectives of this research are achieved. The properties of the switchboard automata and subsystem need to satisfy in order to make the machine well operating. 2020-11 Thesis http://eprints.uthm.edu.my/1169/ http://eprints.uthm.edu.my/1169/1/24p%20NUR%20AIN%20BINTI%20EBAS.pdf text en public http://eprints.uthm.edu.my/1169/2/NUR%20AIN%20BINTI%20EBAS%20COPYRIGHT%20DECLARATION.pdf text en staffonly http://eprints.uthm.edu.my/1169/3/NUR%20AIN%20BINTI%20EBAS%20WATERMARK.pdf text en validuser phd doctoral Universiti Tun Hussein Onn Malaysia Faculty of Applied Science and Technology
institution	Universiti Tun Hussein Onn Malaysia
collection	UTHM Institutional Repository
language	English English English
topic	TK7800-8360 Electronics
spellingShingle	TK7800-8360 Electronics Ebas, Nur Ain Algebraic study of fuzzy finite switchboard automata
description	A finite switchboard automaton has an explicit mechanism which is switchboard that acts as a controller to predict the next input for the interaction within the systems. The classical version of the algebraic automata is a part of theoretical computer science which is not effectively reflecting the practical demands of the computation at the algebraic level. It unable to formalize the controller to predict the flow of the next input information into a designated output. In other words, the algebraic approach is still lacking in terms of their properties. Thus, it is necessary to understand the modeling of switching and commutative mechanisms as a controller in a machine. Fuzzy set theory can be applied to solve the control problems. This research studied on how one can incorporate the fuzzy set into finite switchboard automata and develop algebraic properties. Further, the general algebraic structure such as complete residuated lattices (CRL) has been utilized to enhance the membership grade of the fuzzy finite switchboard automata (FFSA). This research also proposed a specific algorithm for FFSA by the use of CRL. In an automata theory, some machines seldom have the possibility of overlapping transitions to the same state upon the same symbol from the different current states that are called as multi-memberships. Thus, this research considers the multi-memberships in the FFSA which lead to overcome these issues by introducing the theory of the general fuzzy switchboard automata (GFSA) and investigates the topological study of GFSA with the help of switchboard subsystems. The newly defined Kuratowski fuzzy closure operation is used to establish fuzzy topology on a GFSA. Semigroup actions are closely related to automata. By extending the algebraic properties of GFSA, the General Fuzzy Switchboard Transformation Semigroup (GFSTS) has been introduced and the concept of the covering and the products are established. The objectives of this research are achieved. The properties of the switchboard automata and subsystem need to satisfy in order to make the machine well operating.
format	Thesis
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
author	Ebas, Nur Ain
author_facet	Ebas, Nur Ain
author_sort	Ebas, Nur Ain
title	Algebraic study of fuzzy finite switchboard automata
title_short	Algebraic study of fuzzy finite switchboard automata
title_full	Algebraic study of fuzzy finite switchboard automata
title_fullStr	Algebraic study of fuzzy finite switchboard automata
title_full_unstemmed	Algebraic study of fuzzy finite switchboard automata
title_sort	algebraic study of fuzzy finite switchboard automata
granting_institution	Universiti Tun Hussein Onn Malaysia
granting_department	Faculty of Applied Science and Technology
publishDate	2020
url	http://eprints.uthm.edu.my/1169/1/24p%20NUR%20AIN%20BINTI%20EBAS.pdf http://eprints.uthm.edu.my/1169/2/NUR%20AIN%20BINTI%20EBAS%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/1169/3/NUR%20AIN%20BINTI%20EBAS%20WATERMARK.pdf
_version_	1747830749114925056

Algebraic study of fuzzy finite switchboard automata

Similar Items