The smallest finite automaton that accepts the language {x | length of x is…
GATE · 2002 · CS · Question 2 subparts
The smallest finite automaton that accepts the language {x | length of x is divisible by 3} has:
- A.
2 states
- B.
3 states
- C.
4 states
- D.
5 states
Attempted by 862 students.
Sign up free to check your answer
Sign up freeLoading lesson…