Homework No. 2 - NFA
Completion requirements
Opened: Saturday, 16 January 2021, 11:00 AM
Due: Saturday, 23 January 2021, 11:59 PM
Draw an NFA that accepts words from the alphabet {0,1} where the last character is not repeated anywhere else in the word.
(example: words 0, 1, 00001, 111110, ε are in the language of this NFA, while words 010, 111, 0010, 101 are not).
Instructions:
Do not draw automata by hand. Find a software for drawing automata (you can try JFlap) and submit a pdf of the drawing - photos or scans of your handwriting will not be accepted !!!
Submit your solution in the form of a PDF file named <N02-LastnameFirstname.pdf> using just English alphabet characters (example: N02-KavsekBranko.pdf)!
Submissions not following these instructions will be rejected and graded with 0 points!!!