The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has
Correct Option: B
It is $3$ states as we need a state each for length mod $3 = 0, 1$ and $2$.
In the question it is saying {x | length of the x is divisible by 3} not the x itself is divisible by 3 . So, the
answer should be B. 3 states but diagram would be
what about length 0,why initial state is final state?
but your thought on this is not correct question is saying for length of the string must be divisible on by 3 .
64.3k questions
77.9k answers
244k comments
80.0k users
