Question
Use the technique from Section 7.2 to build the state diagram of an NFA- $\lambda$ that accepts the language $(a b)^* b a$. Compare this with the DFA constructed in Exercise 6.16 (a).
Step 1
The language $(ab)^*ba$ consists of strings where the substring $ab$ repeats zero or more times, followed by a single $b$ and then an $a$. Examples of strings in this language include $ba$, $abba$, $ababba$, etc. Show more…
Show all steps
Your feedback will help us improve your experience
100,000+
Students learning Computer Science with Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD