CSCE 433 Formal Languages and Automata
Instructor: Sing-Hoi Sze
Meeting: MWF 1:50-2:40 HRBB 104
Office Hours: MWF 12:50-1:50 HRBB 328B or by appointment
Hopcroft J.E., Motwani R. and Ullman J.D. Introduction to
Automata Theory, Languages and Computation. Addison-Wesley.
This is an undergraduate level course which studies formal models of
computation and the relationships between them. The course will focus
on the question "what is computable" versus "what is not computable" in
- Finite automata and regular expressions: deterministic finite automata,
nondeterministic finite automata, regular expressions, equivalence, closure
properties, pumping lemma.
- Context-free grammar and pushdown automata: context-free grammar,
pushdown automata, equivalence, closure properties, Chomsky normal form,
- Turing machines: Turing machines, variants, nondeterministic Turing
machines, decidability and undecidability, NP-completeness.
- Homework assignments (30%): short written assignments handed
out every one or two weeks.
- Two midterms (20% each).
- One final exam (30%).