Date: Wed, 20 Nov 1996 22:12:24 GMT Server: NCSA/1.4.2 Content-type: text/html Last-modified: Tue, 03 Sep 1996 13:09:09 GMT Content-length: 946
This course serves as an introduction to formal models of languages and computation. Topics covered include finite automata, regular languages, context-free languages, pushdown automata, Turing machines, computability, and NP-completeness.