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: | Fong, Wan Heng, Gan, Yeesiang, Sarmin, Nor Haniza, Turaev, Sherzod |
---|---|
格式: | Conference or Workshop Item |
出版: |
2013
|
主题: | |
在线阅读: | http://eprints.utm.my/id/eprint/50923/ http://dx.doi.org/10.1063/1.4801221 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Automata representation for Abelian groups
由: Fong, Wan Heng, et al.
出版: (2013) -
Automata representation for abelian groups
由: Wan, Heng Fong, et al.
出版: (2012) -
Geometrical representation of automata over some abelian groups
由: Gan, Yee Siang, et al.
出版: (2012) -
Geometrical representation of automata over some abelian groups
由: Gan, Y. S., et al.
出版: (2012) -
Permutation groups in automata diagrams
由: Gan, Yee Siang, et al.
出版: (2013)