dfa-finite automata

Question

Let L1 and L2 be the languages
L1 = {x ∈ {a, b}^∗ | aa is not a substring of x}
L2 = {x ∈ {a, b}^∗ | x ends with ab}

Construct an FA Accepting L1  ∩ L2

Comments

i think this is the answer.

Answer 1

In that case it becomes

L1∩L2 = (a^*b⁺ )^* ab  

Hope now you can draw DFA.

Comments

by your language it will also generate aaab,aaaaaaab which have aa as substring.(due to a*)

---

Hello red devil.

look carefully,there is b⁺

---

@Rupendra Choudhary

your RE is not correct, it is generating strings like aaaabab, aabab,..... which are not in language,

correct RE should be (b + ab)*ab

---

Hello joshi

I'm sorry for wrong answer, i noticed. I marked it wrong.

Answer 2

Number of states=$4$