Question

THEOREM 3.1 Let r be a regular expression. Then there exists some nondeteministic finite accepter that accepts L (r) Consequently, L () is a regular language. Proof: We begin with automata that accept the languages for the simple regular expressions ø, 2, and a E . These are shown in Figure 3.1(a), (b), and (c), respectively. Assume now that we have automata M (r) and M (r) that accept languages denoted by regular expressions ri and r respectively. We need not explicitly construct these automata, but may represent them schematically, as in Figure 3.2. In this scheme, the graph vertex at the left represents the initial state, the one on the right the final state. In Exercise 7. Section 2.3. we claim that for every nfa there is an equivalent one with a single final state, so we lose nothing in assuming that there is only one final state. With M (r) and M (r.) represented in this way, we then construct automata for the regular expressions r +r2 nr, and Iirl. The constructions are shown in Figures 3.3 to 3.5. As indicated in the drawings, the initial and final states of the constituent machines lose their status and are replaced by new initial and final states. By stringing together several such steps, we can build automata for arbitrary complex regular expressions 3. Use the construction in Theorem 3.1 to find an nfa that accepts the language L (ab aa + bba-ab)

Answer 1

AnsuoreGiven hat Lla) fs heorey 3.1, the autonata for Meaut DO the automata ot lat) is The autma h Lb) aud L(b in a aue Can be mannee AfHawands by the autna for kla aa) is otheckn meaug

ftheciem Means is Ahe autoa. yb L(bbak ab) ab) is the autora for L(at aat bba