1/ Create the following NFA N1 using Jflap

2/Test NFA on strings: abaabba and abbbbb

3/Explain why a string is/is not accepted by N1

4/Convert the following NFA N2 to the equivalent DFA.

NFA with empty transition

5/Test DFA on the strings given above.

6/ Save DFA to a file. Describe how jflap stores the set of states and dishtinguishes the set of final states

7/ Show the difference between a file of NFA and a file of DFA

1/ Create the following NFA N1 using Jflap 2/Test NFA on strings: abaabba and abbbbb 3/Explain why a string is/is not accepted by N1 4/Convert the following NFA N2 to the equivalent DFA. 5/ Test DFA on the strings given above. 6/ Save DFA to a file. Describe how jflap stores the set of states and dishtinguishes the set of final states 7/ Show the difference between a file of NFA and a file of DFA