Automata representation for Abelian groups

Wan Heng Fong, Yee Siang Gan, Nor Haniza Sarmin, Sherzod Turaev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 20th National Symposium on Mathematical Sciences, SKSM 2012 - Research in Mathematical Sciences
Subtitle of host publicationA Catalyst for Creativity and Innovation
Pages875-882
Number of pages8
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event20th National Symposium on Mathematical Sciences - Research in Mathematical Sciences: A Catalyst for Creativity and Innovation, SKSM 2012 - Putrajaya, Malaysia
Duration: Dec 18 2012Dec 20 2012

Publication series

NameAIP Conference Proceedings
Volume1522
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference20th National Symposium on Mathematical Sciences - Research in Mathematical Sciences: A Catalyst for Creativity and Innovation, SKSM 2012
Country/TerritoryMalaysia
CityPutrajaya
Period12/18/1212/20/12

Keywords

  • Abelian group
  • Automata diagram
  • Cayley table
  • Finite automata
  • Watson-Crick automata

ASJC Scopus subject areas

  • General Physics and Astronomy

Fingerprint

Dive into the research topics of 'Automata representation for Abelian groups'. Together they form a unique fingerprint.

Cite this