Kerala State PSC Exam Model Paper 4

Question : 7 of 100

Marks: +1, -0

Consider regular expression (0 1) (0 1) ....... n times. Minimum state finite automaton that recognizes the language represented by this regular expression contains