CISC $603MO3HW$

Nondeterministic Finite Automata

Provide solutions to the following exercises. Solutions should be in the form of a hand$-$drawn transition graph $($you may instead use a software tool like the Finite State Machine Designer$).$ Note: Text descriptions and ASCII images will not be accepted.

Linz Section $3\mathrm{.}1$

Complete exercises $1-4,7,8$

Find all strings in $L((a+bb{)}^{**})$ of length five.

Find all strings in $L((ab+b{)}^{**}b(a+ab{)}^{**})$ of length less than four.

Find an nfa that accepts the language $L(a{a}^{**}(ab+b)).$

Find an nfa that accepts the language $L(a{a}^{**}(a+b)).$

Find a regular expression for the set $\{\begin{array}{c}{a}^n{b}^m\text{:}n3\\ m\end{array}$ is odd