|
| Homework 4General Comments
- Problems are taken from the textbook unless otherwise noted.
- For full credit, provide context for each problem, show all calculations, and explain your work/answers.
- Numbers and/or algebra by themselves are not enough.
- You will lose a significant amount of credit if you do not show enough work/context for your answers.
- Precision is very important. You cannot skip steps, make guesses, or use flawed logic. Any of these things can lead to incorrect answers.
- Homework assignments must be very neatly written or typeset
(e.g. using Word or OpenOffice).
- You must indicate any assistance you had on an assignment as specified on the Policies page.
Details| Problem | Comments
|
|---|
| 1.12 | Notice that it is asking for a DFA (not an NFA) and a regular expression. Also notice that the DFA has to have 5 states.
| | 1.18b | Create one based on the descriptions, not based on an NFA/DFA. Trust me, it is much harder to do the conversion from an NFA/DFA.
| | 1.18c | See previous comment.
| | 1.18e | See previous comment.
| | 1.19b | Read the problem! Use the procedure and don't remove states that seem unnecessary. The point is to demonstrate the procedure.
| | 1.20c
| | 1.20e
| | 1.20h
| | 1.39 | It is not enough to provide an example language for each value of k that seems to require at least k states. You need to be certain that it is impossible to do with k-1. |
|
|
|