Deterministic Finite Automaton Assignment | Homework For You
February 18th, 2020
3. (20 marks) Give DFA’s accepting the following languages over the alphabet S = {0,1,3,4,6}: (a) the set of all strings beginning with a 1, 3 or 6, that, when the string is interpreted as an integer in base 7, is a multiple of 4 plus 1.
For example:

• strings 1, 16, 111, 166, 331, 643, 3646, 3334, 36411 and 36433 are in the language;
• the strings 10, 00,011, 0010, 36 , 13, 23, 113, 1313, 2347,2, 21, 161, 3333, 606, 44, 41, and 041 are not. Get Computer Science homework help today