Automata representation for Abelian groups

A finite automaton is one of the classic models of recognition devices, which is used to determine the type of language a string belongs to. A string is said to be recognized by a finite automaton if the automaton "reads" the string from the left to the right starting from the initial stat...

Full description

Bibliographic Details
Main Authors:	Fong, Wan Heng, Gan, Yee Siang, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Conference or Workshop Item
Language:	English
Published:	2013
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/32267/ http://irep.iium.edu.my/32267/ http://irep.iium.edu.my/32267/1/44238-SKSM20_18-20_Dec_2012_AIP_Proceedings_1522_%28Fong_Wan_Heng%29_875-882.pdf

id	iium-32267
recordtype	eprints
spelling	iium-322672013-10-09T03:36:14Z http://irep.iium.edu.my/32267/ Automata representation for Abelian groups Fong, Wan Heng Gan, Yee Siang Sarmin, Nor Haniza Turaev, Sherzod QA Mathematics QA75 Electronic computers. Computer science A finite automaton is one of the classic models of recognition devices, which is used to determine the type of language a string belongs to. A string is said to be recognized by a finite automaton if the automaton "reads" the string from the left to the right starting from the initial state and finishing at a final state. Another type of automata which is a counterpart of sticker systems, namely Watson-Crick automata, is finite automata which can scan the double-stranded tapes of DNA strings using the complimentary relation. The properties of groups have been extended for the recognition of finite automata over groups. In this paper, two variants of automata, modified deterministic finite automata and modified deterministic Watson-Crick automata are used in the study of Abelian groups. Moreover, the relation between finite automata diagram over Abelian groups and the Cayley table is introduced. In addition, some properties of Abelian groups are presented in terms of automata. 2013 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/32267/1/44238-SKSM20_18-20_Dec_2012_AIP_Proceedings_1522_%28Fong_Wan_Heng%29_875-882.pdf Fong, Wan Heng and Gan, Yee Siang and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Automata representation for Abelian groups. In: The 20th National Symposium on Mathematical Sciences - Research in Mathematical Sciences: A Catalyst for Creativity and Innovation, 18–20 Dec. 2012, Palm Garden Hotel, Putrajaya, Malaysia . http://dx.doi.org/10.1063/1.4801221
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English
topic	QA Mathematics QA75 Electronic computers. Computer science
spellingShingle	QA Mathematics QA75 Electronic computers. Computer science Fong, Wan Heng Gan, Yee Siang Sarmin, Nor Haniza Turaev, Sherzod Automata representation for Abelian groups
description	A finite automaton is one of the classic models of recognition devices, which is used to determine the type of language a string belongs to. A string is said to be recognized by a finite automaton if the automaton "reads" the string from the left to the right starting from the initial state and finishing at a final state. Another type of automata which is a counterpart of sticker systems, namely Watson-Crick automata, is finite automata which can scan the double-stranded tapes of DNA strings using the complimentary relation. The properties of groups have been extended for the recognition of finite automata over groups. In this paper, two variants of automata, modified deterministic finite automata and modified deterministic Watson-Crick automata are used in the study of Abelian groups. Moreover, the relation between finite automata diagram over Abelian groups and the Cayley table is introduced. In addition, some properties of Abelian groups are presented in terms of automata.
format	Conference or Workshop Item
author	Fong, Wan Heng Gan, Yee Siang Sarmin, Nor Haniza Turaev, Sherzod
author_facet	Fong, Wan Heng Gan, Yee Siang Sarmin, Nor Haniza Turaev, Sherzod
author_sort	Fong, Wan Heng
title	Automata representation for Abelian groups
title_short	Automata representation for Abelian groups
title_full	Automata representation for Abelian groups
title_fullStr	Automata representation for Abelian groups
title_full_unstemmed	Automata representation for Abelian groups
title_sort	automata representation for abelian groups
publishDate	2013
url	http://irep.iium.edu.my/32267/ http://irep.iium.edu.my/32267/ http://irep.iium.edu.my/32267/1/44238-SKSM20_18-20_Dec_2012_AIP_Proceedings_1522_%28Fong_Wan_Heng%29_875-882.pdf
first_indexed	2023-09-18T20:46:34Z
last_indexed	2023-09-18T20:46:34Z
_version_	1777409714859016192

Automata representation for Abelian groups

Similar Items