14
The minimum number of states in a DFA accepting binary strings divisible by 3 is:
Easy
Back to Theory of Computation
Discussion (0)
- No discussion yet. Ask a doubt or share a shortcut.
Log in to join the discussion.