131 views

Set of binary strings which is divisible by n can be formed by DFA having n states.

So, 8 states. But we can minimize it to 4 states.

edited

min. four state is required

edited
how 8....??
@rajeshwar yadav can u provide me detailed steps on how to got this minimized dfa..!!

as i'm getting 5 states...
construct the dfa for (0+1)*ooo

any string gengerated by this regular expression is divisible by 8

+1 vote