4003-380: Introduction to Computer
Science Theory
Homework
HOMEWORK #1 (Assigned
9/10, Due 9/17)
-
Exercises from Textbook
-
1.38
-
1.39a,b
-
2.10
-
2.36
-
2.39a,b,c
HOMEWORK #2 (Assigned
9/17, Due 9/24)
-
From Textbook
-
3.1a,b
-
3.9a,d,e
-
3.17d,e
-
3.19a,d,e
-
3.33a,b,c (Use subset construction)
HOMEWORK #3 (Assigned
9/27, Due 10/1)
-
From Textbook
-
4.15b,c
-
4.16a,d
-
4.29a
-
4.35a,b (Do not simplify)
-
4.38a (Must use proof of Kleene)
HOMEWORK #4 (Assigned
10/1, Due 10/8)
-
From Textbook
-
Given the regular expression (a*(a + b + abb)*)*
-
Find an FA with minimal number of states that
accepts the language described
-
Go through entire process: RE->NDFA-L -> NDFA
-> FA -> MFA
HOMEWORK #5 (assigned
10/15, Due 10/22)
-
From Textbook
-
6.4a,b
-
6.5b
-
6.9b,c
-
6.13
-
6.22
HOMEWORK #6 (assigned
10/22, Due 10/29)
-
From Textbook
-
7.1
-
7.5b,c
-
7.6 (first PDA only)
-
7.13a,b (remember these should be deterministic)
-
7.21a
HOMEWORK #7 (assigned
10/29, Due 11/5)
-
From Textbook
-
6.39d
-
8.1a,c
-
9.1
-
9.2a,b,c
-
9.6a,b
HOMEWORK #8 (assigned
11/5, Due 11/12)
-
From Textbook
-
9.7
-
9.8
-
9.15a
-
10.16 (Use grammar in Example 10.3)
-
Freebee: Likes/Dislikes
-
a) What topic did you enjoy the most
-
b) What topic did you enjoy the least
last updated: 11/5/2002