Geometrical Representation of Automata over Some Abelian Groups
Keywords:Finite automata, Watson-Crick automata, Group, ℤn, ℤn × ℤn,
AbstractOne 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 ℤn and ℤn × ℤn. The relation of Cayley table to finite automata diagram is introduced in the paper. Some properties of groups ℤn and ℤn × ℤn in terms of automata are also presented in this paper.
Lawson, M. V. Finite Automata. A CRC press company, New York. 2003.
Paun, G, Rozenberg, G, Salomaa, A. DNA Computing. Springer-Verlag Berlin Heidelberg, New York. 1998.
Czeizler, E, Kari, L, Salomaab, K. On the descriptional complexity of Watson–Crick automata. Theoretical Computer Science 410 (2009) 3250–3260. 2009.
Linz, P. An Introduction to Formal Languages and Automata. Jones and Bartlett Publishers. 2006.
Parkes, D. W. Formal Language and the Word Problem in Groups. Department of Mathematics and Computer Science, University of Leicester. 2000.
Rosales, J. C, Garcia-sanchez, P. A. Finitely Generated Commutative Monoids. Nova Sciences Publicher, Inc, New York, United States of America. 1999.