RGPV 2010
Construct a finite automta that will accept those strings of a binary number that are divisible ny three.
or
RGPV 2009
construct DFA for binary integer divisible by 3
Ans. Some example strings = {0, 11, 110, 1001, 1100}
Minimum number of states required = 4
Post a Comment
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.