Automata diagram for groups

Gan, Yee Siang and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Automata diagram for groups. In: 2nd Biennial International Group Theory Conference 2013, February 4-8, 2013, Istanbul, Turki.

PDF - Published Version Restricted to Registered users only Download (80kB) | Request a copy

Abstract

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.

Item Type:	Conference or Workshop Item (Poster)
Additional Information:	6846/32266
Uncontrolled Keywords:	finite automata,Watson-Crick finite automata, Cayley table,automata diagram, group theory
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science
Depositing User:	Dr. Sherzod Turaev
Date Deposited:	11 Oct 2013 14:19
Last Modified:	11 May 2016 17:33
URI:	http://irep.iium.edu.my/id/eprint/32266

Actions (login required)

View Item