CSCI 371
Homework 3 - Due Sept. 11
1. Convert the following NDFSA to a DFSA.
| Current State | Input : 0 | 1 | ε |
| 0 | dead | 0, 3 | 1 |
| 1 | 2 | dead | 3 |
| 2 * accept | dead | 5 | - |
| 3 | 4 | dead | - |
| 4 * accept | dead | 1 | 2, 5 |
| 5 *accept | 4 | dead | - |
2. Convert the following NDFSA to a DFSA
| Current State | Input: a | b |
| 0 | 0,1 | 0 |
| 1 | 2 | 2 |
| 2 | 3 | 3 |
| 3 | 4 | 4 |
| 4 * accept | dead | dead |
Also for #2, describe (in English-like words) the set of strings accepted