1.

Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains

A. n states
B. n + 1 states
C. n + 2 states
D. 2n states
Answer» C. n + 2 states


Discussion

No Comment Found