## Construct DFA which interpreted as binary number is divisible by 2, 3, 4

Prerequisite: Finite Automata Introduction, Designing Finite Automata Problem-1: Construct DFA, which accepts set of all strings over {0, 1} which interpreted as binary number is… Read More »