Question

The minimum number of states are required in dfa that accepts the language defined by the regular expression 1*01(0+11)* is

Answer 1

number of states that the DFA will have ? ... The Minimum number of states required to accept the language L={w|w ε(a+b)*} ... Consider the regular expression (0+1)(0+1 ...