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 o...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia
2012
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/29088/1/FonWanHeng2012_GeometricalRepresentationofAutomataoversomeAbelianGroups.pdf http://eprints.utm.my/id/eprint/29088/ http://mjfas.ibnusina.utm.my/index.php/jfs/article/viewFile/266/191 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|