Geometrical Representation of Automata over Some Abelian Groups

One of the classic models of automata is finite automata, which determine whether a string belongs to a particular language or not. The string accepted by automata is said to be recognized by that automata. Another type of automata, so-called Watson-Crick automata, with two reading heads that work on double-stranded tapes using the complimentary relation. Finite automata over groups extend the possibilities of finite automata and allow studying the properties of groups using finite automata. In this paper, we consider finite automata over some Abelian groups Z(n) and Z(n) x Z(n). The relation of Cayley table to finite automata diagram is introduced in the paper. Some properties of groups Z(n) and Z(n) x Z(n) in terms of automata are also presented in this paper.