📚 Practice Mode
Test 3 - Theory of Computation | Computer Science
Learn at your own pace with hints and detailed explanations
1 / 22
Multiple Choice
The smallest finite automaton, which accepts the language { x | length of x is divisible by 3} has
- 2 states
- 3 states
- 4 states
- 5 states