ace test series

Question

L1=(ab)*

L2=a*b*

L=L1 intersection L2

number of states in MFA that accepts L is?

Comments

yes in dfa

---

MFA is askes MInimal Finite Automata.

L={ε,ab}  only two states needed with NFA.

---

Draw it.

Answer 1

L1 ={ epsilon , ab, abab, ababab......}

L2={epsilon, a,aa,aaa,....b,bb,bbb,....ab, aabbb....}

L1 intersection L2 ={epsilon,ab}

MFA Required three states to accept above language.

Comments

what abt dead state

---

if it is union between them then??