Automata diagram for groups

• Main Authors: Gan, Yee Siang, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
• Format: Conference or Workshop Item
• Language: English
• Published: 2013
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://irep.iium.edu.my/32266/1/50510-BIGTC2013_-_Y._S._Gan.pdf; http://irep.iium.edu.my/32266/; http://istanbulgroup2013.dogus.edu.tr/contributedtalks.htm

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.