• Support PF! Buy your school textbooks, materials and every day products Here!

Deterministic Finite State Automaton Construction

  • Thread starter francis21
  • Start date
  • #1
8
0

Homework Statement


Find a simple DFA (i.e. deterministic finite automaton) that accepts all natural numbers n for which n mod 3 = 0.

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


Homework Equations





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 ≠ 0 etc.

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

Homework Statement





Homework Equations





The Attempt at a Solution

 

Answers and Replies

  • #2
8
0
I have finally solved the problem, so its all good now.

Can the admin close this thread down. Thanks.
 

Related Threads on Deterministic Finite State Automaton Construction

Replies
3
Views
509
  • Last Post
Replies
1
Views
1K
Replies
0
Views
970
Replies
1
Views
941
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
1
Views
709
  • Last Post
Replies
1
Views
5K
  • Last Post
Replies
4
Views
2K
Replies
1
Views
726
Replies
1
Views
3K
Top