Regular expressons

Question

The minimum number of states in an equivalent finite automata for the given regular expression are _____

(a(a(a(a(a(ab)*b)*b)*b)*b)*b)*

Answer 1

(a(a(a(a(a(ab)*b)*b)*b)*b)*b)*

Total 8 states are there in the DFA of the given regular expression.

 

Answer 2

Minimum 7 states required.

Comments

How please prove

---

In the question we are asked for Finite automata means bydefault it’s NFA. Therefore we can ignore dead state. So only 7 states are required.

Answer 3

Total states that are possible is 8.