The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)*(10) is ____________ (A) 2 (B) 3 (C) 4 (D) 5 Answer: (B) Explanation: Below is NFA for the given regular expression (0 + 1)*(10)
Quiz of this Question