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: | , , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 出版: |
2012
|
| 主题: | |
| 在线阅读: | http://eprints.utm.my/id/eprint/36447/ http://aip.scitation.org/doi/abs/10.1063/1.4801221?journalCode=apc |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|