(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Find a simple DFA (i.e. deterministic finite automaton) that accepts all natural numbersnfor whichnmod 3 = 0.

Hint:A natural number is divisible by 3 if its checksum (or sum of digits) is divisible by 3.

2. Relevant equations

3. The attempt at a solution

I'm not sure how the hint can help for this question, even though I know what it means. For instance,137 = 1+3+7 = 11 mod 3 ≠ 0etc.

Any other useful hints or suggestions would be great. Thanks. :)

1. The problem statement, all variables and given/known data

2. Relevant equations

3. The attempt at a solution

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Deterministic Finite State Automaton Construction

**Physics Forums | Science Articles, Homework Help, Discussion**