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...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Diterbitkan: |
2013
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/50923/ http://eprints.utm.my/50923/ |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!