Dfa mod 5 binary options

May 15, 2016. Design DFA accepting Binary numbers divisible by number 'n . For n = 5, five states in DFA corresponding to five reminder information as follows: . . . as pgv from pprint import pprint from random import choice as rchoice def baseN(n, b, .