Millionaire Mode

Test 3 - Theory of Computation | Computer Science

Question 1 of 22

The smallest finite automaton, which accepts the language { x | length of x is divisible by 3} has

  1. 2 states
  2. 3 states
  3. 4 states
  4. 5 states

Prize Money

15₹7 Crores
14₹1 Crore
13₹50,00,000
12₹25,00,000
11₹12,50,000
10₹6,40,000
9₹3,20,000
8₹1,60,000
7₹80,000
6₹40,000
5₹20,000
4₹10,000
3₹5,000
2₹2,000
1₹1,000