Word Count : 150

---

For the language denoted by $(a+b)^*ab$ (all strings over $\{a,b\}$ that end with “ab”), a minimal DFA is: Alphabet: $\{a,b\}$. States: $q_0$ (start), $q_1$, $q_2$ _____ ________ _______ ___ _______ ________ ______ _______ __________ __________ ______ _________.
_____ _________ ____ __________ _______ _____ __________.
________ _______ _______ _________ ___ __________ _______ ________ ________.
_____ ___ ___ ___ _________.
_____ _______ ___ _______ _____ ________ ____ _____ ___ ________ ______.
______ _________ ______ ________ ______ __________ _________ _____ ___ _____ ____ ____.
_________ _______ ____ ___ __________ _________ __________ ____ ________ _______.
_________ ________ ______ _____ _________.
_________ _______ _______ _______ ________ ___ _________ ___ _________ ______.
_________ _____ _________ ___ _________ __________ _________ ________ ______ ________.
____ ____ ________ ________ _______ _________ _______ __________ _______ _________.
______ _________ _____ __________ ____ _________ ___ ________.
______ __________ __________ __________ _________ _________ ______ _______ _________.
___ ________ ______ ______ ______.
_________ _______.
Get Full Answer on WhatsApp