#selfDoubt

Question

what will be the DFA for RE – (a*ba)*

Answer 1

Minimal DFA contains 4 states only. the following figure shows minimal DFA for a given regular expression:

$L={\epsilon,ba,baba,bababa….,aba,aaba,aaaba,….ababa, aababa...\infty}$

 

 

Answer 2

 

 

 

only four state is sufficient  

Comments

but RE – (a*ba)* is also accepting epsilon but above DFA is not accepting epsilon.

---

 Dknights Given DFA accepts $\epsilon$ because initial state in the final state

Answer 3

4 State

Comments

i think dead state also included

---

 abhinowKatore above finite automata is not DFA, not even minimal.