edited by
7,832 views
26 votes
26 votes

The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has

  1. $2$ states
  2. $3$ states
  3. $4$ states
  4. $5$ states
edited by

3 Answers

Best answer
30 votes
30 votes

Correct Option: B

It is $3$ states as we need a state each for length mod $3 = 0, 1$ and $2$.

edited by
Answer:

Related questions

25 votes
25 votes
1 answer
2
Kathleen asked Sep 15, 2014
4,169 views
We require a four state automaton to recognize the regular expression $(a\mid b)^*abb$Give an NFA for this purposeGive a DFA for this purpose