Automata representation for abelian groups

• Main Authors: Fong, Wan Heng, Gan, Yeesiang, Sarmin, Nor Haniza, Turaev, Sherzod
• 格式: Conference or Workshop Item
• 出版: 2013
• 主題: Q Science
• 在線閱讀: http://eprints.utm.my/id/eprint/50923/; http://dx.doi.org/10.1063/1.4801221

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...