## Discussion Forum

Que. | 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. | 2^n states |

Answer:n + 1 states |