b) Construct an NFA which accepts this language: L(aa* (a + b)) c) Construct an NFA...

Transcribed Image Text:

b) Construct an NFA which accepts this language: L(aa* (a + b)) c) Construct an NFA which accepts this language: L(ab * a * ) n L((ab) * ba) d) Construct an NFA which accepts this language: L((a + b)a*) L(baa*) e) For the following automaton, find its corresponding regular expression: qo b b a b 93 a b) Construct an NFA which accepts this language: L(aa* (a + b)) c) Construct an NFA which accepts this language: L(ab * a * ) n L((ab) * ba) d) Construct an NFA which accepts this language: L((a + b)a*) L(baa*) e) For the following automaton, find its corresponding regular expression: qo b b a b 93 a