hw6sp00 - COT3100, Spring 2000 S. Lang Assignment #6...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
COT3100, Spring 2000 Assigned: 4/19/2000 S. Lang Assignment #6 (Optional *) Due: 4/24 in class *This assignment is optional in the following sense: (1) You need to understand the materials contained in this assignment because they provide useful exercises on the last segment of the course; (2) If you turn in the assignment within the first 10 minutes of the last class (on 4/24), your score on the assignment can be used to replace the lowest score of your earlier assignments (i.e., out of the 6 assignments including this one, the lowest score will be dropped); (3) If you missed, or being exempted from, an earlier assignment, you must do this assignment to receive a total of 5 assignment scores; that is, every one in the class will be responsible for 5 assignment scores in calculating the grades. Here are the questions: 1. Give a regular expression for each of the following languages (no proof or explanation is required): (a) The set of strings over { a , b } that do not contain the substring
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
Ask a homework question - tutors are online