Formal Languages Homeworks
1.	Deterministic Finite Automata
2.	Epsilon-NFA's
3.	Nondeterministic Finite Automata
4.	Regular Expressions --- Basics
5.	Regular Expressions --- Algebra and FA Equivalence
6.	Minimization of DFA's
7.	Regular Languages
8.	CFG's
9.	CFG's --- Additional Questions
10.	CFG's --- Proofs
11.	Parse Trees
12.	Parse Trees --- Additional Questions
13.	Pushdown Automata
14.	CFG's --- Normal Forms
15.	Turing Machines