Automata representation for abelian groups
A finite automaton is one of the classic models of recognition devices, which is used to determine the type of language a string belongs to. A string is said to be recognized by a finite automaton if the automaton "reads" the string from the left to the right starting from the initial stat...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/36447/ http://aip.scitation.org/doi/abs/10.1063/1.4801221?journalCode=apc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |