Automata representation for Abelian groups

• Main Authors: Fong, Wan Heng, Gan, Yee Siang, Sarmin, Nor Haniza, Turaev, Sherzod
• Format: Conference or Workshop Item
• Language: English
• Published: 2013
• Subjects: QA Mathematics; QA75 Electronic computers. Computer science
• Online Access: http://irep.iium.edu.my/32267/1/44238-SKSM20_18-20_Dec_2012_AIP_Proceedings_1522_%28Fong_Wan_Heng%29_875-882.pdf; http://irep.iium.edu.my/32267/; 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...