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...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Conference or Workshop Item |
| 出版事項: |
2013
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utm.my/id/eprint/50923/ http://dx.doi.org/10.1063/1.4801221 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|