The smallest finite automation which accepts the language { x | length of x is…
GATE · Computer Science · 2002
The smallest finite automation which 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 836 students.
Sign up free to check your answer
Sign up freeLoading lesson…