[CS Dept logo]

Introduction to Formal Languages and Theory of Computation
Autumn 1999

The final is on Wednesday 8 Dec early in the morning at 8:00 a.m. Place is RY 277 as usual.

CS280 addresses basic questions about computation and models of computation. Given a C program, is it possible to write a Scheme program that does exactly the same task? Is it possible to write a C program which takes in any C program as input and says if the input program uses only finite memory for any finite input?

Answering these and other questions requires a precise understanding of the power and limitations of computing. Finite automata, context free grammars and Turing machines are the three components of CS280.

Instructor: Divakar Viswanath

Grader: Murali Krishnan

Course Information


Homework Solutions



Midterm Solutions