Assumptions for this exercise $...$

Alphabet $=\{a,b\}$

To do in this exercise $...$

Construct a Nondeterministic Finite Accepter $M$ such that

$L(M)=L(a{b}^{**}aa+bb{a}^{**}ab),$ the language denoted by the regular expression

$a{b}^{**}aa+bb{a}^{**}ab.$

Save Nondeterministic Finite Accepter as a JFLAP file