akluke7182 akluke7182 16-12-2022 Computers and Technology contestada design a deterministic finite automaton that accepts all binary strings that correspond to a value divisible by 3. for example, it should accept 110 (since 6 is divisible by 3), but not 101 (since 5 is not divisible by 3).