🎴 Flashcard Mode
Test 3 - Theory of Computation | Computer Science
Card1 / 22
Mastered0
Review0
QuestionClick to flip
The smallest finite automaton, which accepts the language { x | length of x is divisible by 3} has
AnswerClick to flip back
A
3 states
💡 Explanation:
