1. Σ consists of your initials, write down Σ , Σ * , Σ +
2. Suppose Language L consists of strings generated from Σ in 1 above, such that strings in L have one and only one the initial of your last name. Draw a NFA that accepts L.
3. Find a DFA that accepts all strings starting with your initials. Write down the quintuple in the DFA.
4. List the elements of each set where N = { 1, 2, 3, ... }. Write down the names of the operations in question d to i:
a. A = { x ∈ N | 3 < x < 8}
b. B = { x ∈ N | x is even, x < 11 }
c. C = { x ∈ N | 4 + x = 3 }
d. A ∪ B
e. A ∩ B
f. A B (or A - B )
g. |A|, and |B|
h. A
i. A x B