Automata diagram for groups
Automata act as the recognition devices to determine the types of languages a string belongs to, by using the transition graph. In the previous researches, the classical models of automata have been used to recognize the strings in languages. Recently, the relation of automata and Cayley table of th...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/32266/ http://irep.iium.edu.my/32266/ http://irep.iium.edu.my/32266/1/50510-BIGTC2013_-_Y._S._Gan.pdf |
| id |
iium-32266 |
|---|---|
| recordtype |
eprints |
| spelling |
iium-322662016-05-11T09:33:36Z http://irep.iium.edu.my/32266/ Automata diagram for groups Gan, Yee Siang Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA75 Electronic computers. Computer science Automata act as the recognition devices to determine the types of languages a string belongs to, by using the transition graph. In the previous researches, the classical models of automata have been used to recognize the strings in languages. Recently, the relation of automata and Cayley table of the group have been studied to relate automata theory with group. In the study of automata and group theory, it has been found that automata diagram can be used to analyse properties of some groups such as Abelian groups and Permutation groups. Such automata that are used are modified finite automata and Watson-Crick finite automata. Thus in this paper, the definition and some properties of group in terms of automata diagram are given. 2013-02-08 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/32266/1/50510-BIGTC2013_-_Y._S._Gan.pdf Gan, Yee Siang and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Automata diagram for groups. In: 2nd Biennial International Group Theory Conference 2013, February 4-8, 2013, Istanbul, Turki. http://istanbulgroup2013.dogus.edu.tr/contributedtalks.htm |
| repository_type |
Digital Repository |
| institution_category |
Local University |
| institution |
International Islamic University Malaysia |
| building |
IIUM Repository |
| collection |
Online Access |
| 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 Automata diagram for groups |
| description |
Automata act as the recognition devices to determine the types of languages a string belongs to, by using the transition graph. In the previous researches, the classical models of automata have been used to recognize the strings in languages. Recently, the relation of automata and Cayley table of the group have been studied to relate automata theory with group. In the study of automata and group theory, it has been found that automata diagram can be used to analyse properties of some groups such as Abelian groups and Permutation groups. Such automata that are used are modified finite automata and Watson-Crick finite automata. Thus in this paper, the definition and some properties of group in terms of automata diagram are given. |
| format |
Conference or Workshop Item |
| 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 |
Automata diagram for groups |
| title_short |
Automata diagram for groups |
| title_full |
Automata diagram for groups |
| title_fullStr |
Automata diagram for groups |
| title_full_unstemmed |
Automata diagram for groups |
| title_sort |
automata diagram for groups |
| publishDate |
2013 |
| url |
http://irep.iium.edu.my/32266/ http://irep.iium.edu.my/32266/ http://irep.iium.edu.my/32266/1/50510-BIGTC2013_-_Y._S._Gan.pdf |
| first_indexed |
2023-09-18T20:46:34Z |
| last_indexed |
2023-09-18T20:46:34Z |
| _version_ |
1777409714701729792 |