Homework No. 4 - RE
Completion requirements
Opened: Saturday, 30 January 2021, 11:00 AM
Due: Saturday, 6 February 2021, 11:59 PM
Write a regular expression that describes the languages of automata from Homework No. 2 and Homework No. 3.
Hint: It's the same language.
Instructions:
Do not write the regular expression by hand. Use a text editor or some other software (you can try JFlap) and submit in the form of a pdf file - photos or scans of your handwriting will not be accepted !!!
Submit your solution in the form of a PDF file named <N04-LastnameFirstname.pdf> using just English alphabet characters (example: N04-KavsekBranko.pdf)!
Submissions not following these instructions will be rejected and graded with 0 points!!!