Question

Construct a DFA that accepts a language generated by a grammar

S->abA

A->baB

B->aA|bb

Find tha DFA and regular expression

Answer 1

Since there is no null production, so we cannot determine the final state.. This grammar looks incomplete.

Comments

pic is not DFA

it is NFA

---

corrected... thnkss for pointing out..

---

no the regular expression was ok
abba(aba)*bb
But as in every state it was not accepting a and b both
that is why it was not DFA, it was a NFA
Now, if u add a reject state in that diagram, then it will be DFA

---

where to add a reject state in that transition diagram ... Please show..

---

https://people.cs.nctu.edu.tw/~wgtzeng/courses/FL2016SpringUnder/HW2-Solutions-2016-Spring.pdf

Check question no.14

---

yes i noticed that mistake..actually we need null production for final state and it was absent in this grammer so i edited my answer..although we can draw dfa using regex..adding a dead state and pointing all missing transitions to dead will do our job..

Answer 2

we can drow NFA  from the given grammar.