-
The smallest finite automata which accepts the language {x| length of x is divisible by 3} has
-
- 2 states
- 3 states
- 4 states
- 5 states
- 2 states
Correct Option: B
Answer in the book is wrong
Start & end are same as (a) hence the minimum no. of states required are3. Option (b) is correct. If string traversal doesn't stop at (a) then string length is not divisibleby 3.
