Theory of Algorithms, Spring 2000
You may retrieve the following files in PDF format. You will need Adobe Acrobat Reader to view these files.
Syllabus for Section 1, Tues, Thurs 5:00 - 6:15.
Syllabus for Section 2, Tues, Thurs 2:00 - 3:15.
Notes on decidability and semi-decidability, pages 1 - 7.
Notes on decidability and semi-decidability, pages 8 - 10.
Notes on the equivalence of npda's and context-free grammars.
Homework assignment on the equivalence of npda's and context-free grammars.