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$ (accept). Intuition: $q_0$ = “no ________ _______ _______ ___ ____ _______ ____ ___ _______ __________ ____.
__________ _______ _________ __________ ____ ___ ___ ________ ___ ________ ______ _____.
______ _____ _______ __________ ______ __________ __________ ____ ___ ___ ________.
_________ ___ _____ ____ ________ ____ _______ ________ _______ ________.
__________ ____ __________ _________ ___ ___ _________ ________ ___.
_____ _____ ___ ______ __________.
____ _______ ________ ________ _____.
_____ ______ ______ _________ ___ __________.
_____ _________ __________ _____ __________ _____ __________ ____.
____ ______ ______ _____ ______ _____ ___ _______ _______.
______ _____ ___ ____ ________ __________ _____ ______ _________ ______ _________ ________.
___ _____ ________ _________ ___ ____ ______ _______ ________ _____ _______.
_______ _____ _________ _____ __________ _________ ________.
______ ___ _________ __________.
Get Full Answer on WhatsApp