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 g...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
2013
|
| Subjects: |
| _version_ | 1796857979089190912 |
|---|---|
| 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 |
| collection | ePrints |
| 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. |
| first_indexed | 2024-03-05T19:05:52Z |
| format | Article |
| id | utm.eprints-40992 |
| institution | Universiti Teknologi Malaysia - ePrints |
| last_indexed | 2024-03-05T19:05:52Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | utm.eprints-409922017-08-23T08:12:49Z http://eprints.utm.my/40992/ Permutation groups in automata diagrams Gan, Yee Siang Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Q 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. 2013-02 Article PeerReviewed 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 https://www.researchgate.net/publication/236901047_Permutation_Groups_in_Automata_Diagrams |
| spellingShingle | Q Science Gan, Yee Siang Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Permutation groups in automata diagrams |
| title | 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_short | Permutation groups in automata diagrams |
| title_sort | permutation groups in automata diagrams |
| topic | Q Science |
| work_keys_str_mv | AT ganyeesiang permutationgroupsinautomatadiagrams AT fongwanheng permutationgroupsinautomatadiagrams AT sarminnorhaniza permutationgroupsinautomatadiagrams AT turaevsherzod permutationgroupsinautomatadiagrams |