Test 3 - Theory of Computation | Computer Science

Casual Mode - Take your time!

1 / 22
✓
Correct
0
✗
Incorrect
0
★
Score
0%
Multiple Choice

The smallest finite automaton, which accepts the language { x | length of x is divisible by 3} has

  1. 2 states
  2. 3 states
  3. 4 states
  4. 5 states
Change Mode