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.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1063/1.4801221
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | automata, finite automata, Watson-Crick automata, Cayley table, Abelian group, automata diagram |
| Subjects: | Q Science |
| Divisions: | Science |
| ID Code: | 50923 |
| Deposited By: | Haliza Zainal |
| Deposited On: | 27 Jan 2016 01:53 |
| Last Modified: | 12 Jun 2017 05:00 |
Repository Staff Only: item control page
