2) Construct a NFA N, that recognizes the language L(N3)UL(Na). Use the Grafstate Simulator to show...

  

Transcribed Image Text:

2) Construct a NFA N, that recognizes the language L(N3)UL(Na). Use the Grafstate Simulator to show 2 strings that are accepted by N, and 2 strings that are rejected by Ns. 3 Construct a NFA N, that recognizes the language L(N,)-L(N.). Use the Grafstate Simulator to show 2 strings that are accepted by N, and 2 strings that are rejected by N. Construct a NFA N, that recognizes the language L(N3)*. Use the Grafstate Simulator to show 2 strings that are accepted by N, and 2 strings that are rejected by N. b 91 Nondeterministic finite automaton b 93 a 92 b a b b Grafstate N4 94 2) Construct a NFA N, that recognizes the language L(N3)UL(Na). Use the Grafstate Simulator to show 2 strings that are accepted by N, and 2 strings that are rejected by Ns. 3 Construct a NFA N, that recognizes the language L(N,)-L(N.). Use the Grafstate Simulator to show 2 strings that are accepted by N, and 2 strings that are rejected by N. Construct a NFA N, that recognizes the language L(N3)*. Use the Grafstate Simulator to show 2 strings that are accepted by N, and 2 strings that are rejected by N. b 91 Nondeterministic finite automaton b 93 a 92 b a b b Grafstate N4 94