GATE | GATE CS 1997 | Question 64 Improve Improve Like Article Like Save Share Report Construct a finite state machine with minimum number of states, accepting all strings over {a, b} such that the number of a‘s is divisible by two and the number of b‘s is divisible by three. Answer: Explanation: Quiz of this QuestionPlease comment below if you find anything wrong in the above post Last Updated : 30 Oct, 2017 Like Article Save Article Previous GATE | GATE CS 1997 | Question 30 Next GATE | GATE CS 1997 | Question 65 Share your thoughts in the comments Add Your Comment Please Login to comment...