Lec-12: DFA of all binary strings divisible by 3 | DFA Example 5

Transcript

hello those so great smashes make us forget their next example is construct a DFA which has hacked a language of all binary strings divisible by three over the alphabet 0 & 1 2 GB a proportionate divisible by 3 it visible by 2 5 ome popco is typing questions go chemically a simple symmetric apparently a checker lo que a Kissimmee number code divisi... Read More