Question

Write the finite automata corresponding to the regular expression (a + b)*ab

29 Apr 2025
Answer :
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 relevant suffix yet,” $q_1$ =
_______ _______ ____ ______ __________.
_________ ___ _________ __________ ______ __________ __________ _____ ____.
_______ ________ _______ ______ _____ ______.
_______ ___ ________ ___ ___ ______.
_____ _________ ____ _________ ___ ___ ____ ________ _______.
________ ____ ______ _________ _______ _________ ___ ____.
____ __________ _____ ______ _______.
____ _________ ____ _________ _______ _______ _____ ______ _________ _____ ______ _____.
____ _________ _________ _______ ________ __________ _______ __________.
______ ________ _______ _______ __________ ______ _____ _________ _______ _____ ____ ____.
____ __________ ____ ___ ______ ___ _________ _____.
________ _____ ________ _________ ______ ___.
_________ ____ __________ _________ ____ ______ _________.
________ _____ ___ _____ ____ _______ _______ ______ _____ ________.
__________ ________ ______ ______.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU MCS 212 2025 - Write the finite automata corresponding to the regular expression (a + | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→