Question

Let l be the language represented by the regular expression 0011 where = {0, 1}. What is the minimum number of states

Answer 1

First we can draw dfa for L which has 5 states after that for L compliment we will convert all final to non final and all non final to final so, total states is 5.