Jan 25
preliminaries
Discuss chapter 0; particularly sets, symbols, languages, relations, outer product.
Part of assignment for next Tue will be chapter 0 exercises.
regular languages, part 1
Discuss chapter 1 (we won't get through all of this today):
- DFA examples and definition
- regular language definition
- regular operations : A ∪ B , A ° B, A*
- NFA examples and definition
- equivalence of DFA and NFA
- regular expressions, e.g. Σ*1Σ*
- ε (empty string) vs ∅ (empty set)
- GNFA definition, convenient for several proofs
- equivalence of regular languages and finite automata
- nonregular languages and pumping lemma
And the rest of next Tues will be problems from chap 1;
stay tuned.
