Solutions are available.
Problem 0: Review old homeworks.
Problem 1: Give a regular expression that generates the language over the alphabet {a, b} where each b in the string is followed by exactly one or three a's (so e, aaa, and babaaa are in the language but baabaaa is not).
Problem 2: Give a nondeterministic finite automaton that accepts the language generated by the regular expression (a &cup ba &cup baaa)*.
Problem 3: Convert the following NFA to a DFA that accepts the same
language.
Problem 4: Find a DFA equivalent to the following DFA that
has as few states as possible.
Problem 5: Find a regular expression that generates the language
accepted by the following DFA.
Problem 6: Show that the lanaguge defined by {banbam | m > n} is not regular.