Please show all work.

Question 1

a) Find an nfa that accepts the following language: L((abab)* +(aaa* +b)*).

b)

c)

d)

What language is accepted by the following generalized transition graph? a a + B a + b* a + b a*+b+c Find regular expressions for the languages accepted by the following automata. b a b C Find a regular expression for the following languages on {a,b}. L = {w: na (w) and nb (w) are both odd}. What language is accepted by the following generalized transition graph? a a + B a + b* a + b a*+b+c Find regular expressions for the languages accepted by the following automata. b a b C Find a regular expression for the following languages on {a,b}. L = {w: na (w) and nb (w) are both odd}