Cover Image

Permutation groups in automata diagrams

Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types of languages a string belongs to. In the study of automata and group theory, it has been found that the properties of a...

Full description

Saved in:
Bibliographic Details
Main Authors: Gan, Yee Siang, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format: Article
Language:English
Published: Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia 2013
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://irep.iium.edu.my/29793/1/PermutationGroups_in_Automata_Diagrams_MJFAS_9_1_35_40.pdf
http://irep.iium.edu.my/29793/
http://mjfas.ibnusina.utm.my/index.php/jfs/article/view/349
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.iium.irep.29793
record_format dspace
spelling my.iium.irep.297932013-04-24T08:05:02Z http://irep.iium.edu.my/29793/ Permutation groups in automata diagrams Gan, Yee Siang Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA75 Electronic computers. Computer science Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types of languages a string belongs to. In the study of automata and group theory, it has been found that the properties of a group can be recognized by the automata using the automata diagrams. There are two types of automata used to study the properties of a group, namely modified finite automata and modified Watson-Crick finite automata. Thus, in this paper, automata diagrams are constructed to recognize permutation groups using the data given by the Cayley table. Thus, the properties of permutation group are analyzed using the automaton diagram that has been constructed. Moreover, some theorems for the properties of permutation group in term of automata are also given in this paper. Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia 2013-02-25 Article REM application/pdf en http://irep.iium.edu.my/29793/1/PermutationGroups_in_Automata_Diagrams_MJFAS_9_1_35_40.pdf Gan, Yee Siang and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Permutation groups in automata diagrams. Malaysian Journal of Fundamental and Applied Sciences, 9 (1). pp. 35-40. ISSN 1823-626X http://mjfas.ibnusina.utm.my/index.php/jfs/article/view/349
institution Universiti Islam Antarabangsa Malaysia
building IIUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider International Islamic University Malaysia
content_source IIUM Repository (IREP)
url_provider http://irep.iium.edu.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Gan, Yee Siang
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
Permutation groups in automata diagrams
description Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types of languages a string belongs to. In the study of automata and group theory, it has been found that the properties of a group can be recognized by the automata using the automata diagrams. There are two types of automata used to study the properties of a group, namely modified finite automata and modified Watson-Crick finite automata. Thus, in this paper, automata diagrams are constructed to recognize permutation groups using the data given by the Cayley table. Thus, the properties of permutation group are analyzed using the automaton diagram that has been constructed. Moreover, some theorems for the properties of permutation group in term of automata are also given in this paper.
format Article
author Gan, Yee Siang
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
author_facet Gan, Yee Siang
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
author_sort Gan, Yee Siang
title Permutation groups in automata diagrams
title_short Permutation groups in automata diagrams
title_full Permutation groups in automata diagrams
title_fullStr Permutation groups in automata diagrams
title_full_unstemmed Permutation groups in automata diagrams
title_sort permutation groups in automata diagrams
publisher Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia
publishDate 2013
url http://irep.iium.edu.my/29793/1/PermutationGroups_in_Automata_Diagrams_MJFAS_9_1_35_40.pdf
http://irep.iium.edu.my/29793/
http://mjfas.ibnusina.utm.my/index.php/jfs/article/view/349
_version_ 1643609759830507520
score 13.211869

Similar Items