AsSIGNMENT

Book Section $11\mathrm{.}2$ Problem $6$a $($page $768)$

Use the algorithm $(11\mathrm{.}2\mathrm{.}3)$ to turn

$(ab{)}^{**}$

into an NFA.

$2.$

Use the algorithm $(11\mathrm{.}2\mathrm{.}4)$ to find a regular expressions for the language accepted by the NFA as follows.

a$.$ Delete state $1$ before deleting state $2.$

$3.$

Use the algorithm $(11\mathrm{.}2\mathrm{.}4)$ to find a regular expressions for the language accepted by the NFA as follows.

b$.$ Delete state $2$ before deleting state $1.$

$4.$ Book Section $11\mathrm{.}2$ Problem $9($page $768)$

Use algorithm $(11\mathrm{.}2\mathrm{.}4)$ to find a regular expression for the language accepted by the following NFA:

Hint: i and $j$ may be the same stet when eliminating state $k.$