| Homework Assignment # 1: |
| due: February 4, 2020 |
| Problem | page | credit | |
| Section 1.2: | |||
| 10 | 28 | 10 | |
| 11 b | 28 | 15 | |
| 14 c | 29 | 10 | |
| 17 b | 29 | 10 | |
| 22 | 30 | 10 | |
| 23 | 30 | 10 | |
| Section 1.3: | |||
| 12 | 36 | 35 | |
Solutions PDF format
| Homework Assignment # 2: |
| due: February 13, 2020 |
| Problem | page | credit | |
| Section 2.1: | |||
| 4 d | 48 | 20 | |
| 5 a | 49 | 20 | |
| 11 a | 49 | 20 | |
| 14 | 50 | 10 | |
| Section 2.2: | |||
| 8 | 57 | 10 | |
| Find a DFA that accepts the same language | |||
| as the NFA from problem 13 | 57 | 20 | |
Solutions PDF format
| Homework Assignment # 3: |
| due: March 17, 2020 |
| Problem | page | credit | ||
| Section 2.4: | ||||
| 3 b | 72 | 15 | Use the k-equivalence algorithm | |
| you do not need to prove | ||||
| that the result is minimal | ||||
| Section 3.1: | ||||
| 9 b | 78 | 10 | ||
| 10 | 78 | 10 | ||
| 19 b | 79 | 10 | ||
| Section 3.2: | ||||
| 6 a | 90 | 25 | Use the McNaughton-Yamada algorithm, | |
| then minimize the dfa | ||||
| using the k-equivalence algorithm | ||||
| 6 b | 90 | 30 | Use the McNaughton-Yamada algorithm, | |
| then minimize the dfa | ||||
| using the k-equivalence algorithm | ||||