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...
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Proceeding Paper |
| 言語: | English |
| 出版事項: |
2013
|
| 主題: | |
| オンライン･アクセス: | http://irep.iium.edu.my/32267/1/44238-SKSM20_18-20_Dec_2012_AIP_Proceedings_1522_%28Fong_Wan_Heng%29_875-882.pdf |