Q2.13MCQ2 marks, −0.5The smallest finite automaton which accepts the language {x∣\{x \mid{x∣ length of xxx is divisible by 3}3\}3} has(A)222 states(B)333 states(C)444 states(D)555 statesSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google