Gan, Yee Siang and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod
(2013)
*Permutation groups in automata diagrams.*
Malaysian Journal of Fundamental and Applied Sciences, 9
(1).
pp. 35-40.
ISSN 1823-626X

Full text not available from this repository.

Official URL: https://www.researchgate.net/publication/236901047...

## Abstract

Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types of languages a string belongs to. In the study of automata and group theory, it has been found that the properties of a group can be recognized by the automata using the automata diagrams. There are two types of automata used to study the properties of a group, namely modified finite automata and modified Watson-Crick finite automata. Thus, in this paper, automata diagrams are constructed to recognize permutation groups using the data given by the Cayley table. Thus, the properties of permutation group are analyzed using the automaton diagram that has been constructed. Moreover, some theorems for the properties of permutation group in term of automata are also given in this paper.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | finite automata, watson-crick finite automata, cayley table, permutation group, automata diagram |

Subjects: | Q Science |

Divisions: | Biosciences and Bioengineering (Formerly known) |

ID Code: | 40992 |

Deposited By: | Liza Porijo |

Deposited On: | 20 Aug 2014 16:19 |

Last Modified: | 23 Aug 2017 16:12 |

Repository Staff Only: item control page