Please use this identifier to cite or link to this item:
|Title:||COMP 394-01, Automata Theory, Fall 1998|
|Keywords:||Computer Science;Syllabus;Curriculum;1998 Fall|
|Series/Report no.:||Syllabi CRN|
|Abstract:||We will prove theorems about the abilities and limitations of abstract computing machines. We will cover most of the material in the text, including all of chapters 1, 2, 3, and 4 and parts of chapters 5, 6, 7, 8, and 9.|
|Description:||This syllabus was submitted to the Rhodes College Office of Academic Affairs by the course instructor.|
|Appears in Collections:||Computer Science. Syllabi|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.