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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2013
|
| Subjects: |
| _version_ | 1796859539143786496 |
|---|---|
| author | Fong, Wan Heng Gan, Yeesiang Sarmin, Nor Haniza Turaev, Sherzod |
| author_facet | Fong, Wan Heng Gan, Yeesiang Sarmin, Nor Haniza Turaev, Sherzod |
| author_sort | Fong, Wan Heng |
| collection | ePrints |
| 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. |
| first_indexed | 2024-03-05T19:28:39Z |
| format | Conference or Workshop Item |
| id | utm.eprints-50923 |
| institution | Universiti Teknologi Malaysia - ePrints |
| last_indexed | 2024-03-05T19:28:39Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | utm.eprints-509232017-06-12T05:00:22Z http://eprints.utm.my/50923/ Automata representation for abelian groups Fong, Wan Heng Gan, Yeesiang Sarmin, Nor Haniza Turaev, Sherzod Q 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 Fong, Wan Heng and Gan, Yeesiang and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Automata representation for abelian groups. In: Proceedings Of The 20th National Symposium On Mathematical Sciences (SKSM20): Research In Mathematical Sciences: A Catalyst For Creativity And Innovation, PTS A And B, 18 December 2012 through 20 December 2012, Putrajaya; Malaysia. http://dx.doi.org/10.1063/1.4801221 |
| spellingShingle | Q Science Fong, Wan Heng Gan, Yeesiang Sarmin, Nor Haniza Turaev, Sherzod Automata representation for abelian groups |
| title | 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_short | Automata representation for abelian groups |
| title_sort | automata representation for abelian groups |
| topic | Q Science |
| work_keys_str_mv | AT fongwanheng automatarepresentationforabeliangroups AT ganyeesiang automatarepresentationforabeliangroups AT sarminnorhaniza automatarepresentationforabeliangroups AT turaevsherzod automatarepresentationforabeliangroups |