Homework No. 1 - DFA
Completion requirements
Opened: Saturday, 9 January 2021, 11:00 AM
Due: Saturday, 16 January 2021, 11:59 PM
Draw a deterministic finite state automaton that accepts a language of all the words ending with "lly".
The alphabet is the set of all letters of the English alphabet.
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 <N01-LastnameFirstname.pdf> using just English alphabet characters (example: N01-KavsekBranko.pdf)!
Submissions not following these instructions will be rejected and graded with 0 points!!!