1. Rhodes College Digital Archives - DLynx
  2. Academics
  3. Course Syllabi
Please use this identifier to cite or link to this item: http://hdl.handle.net/10267/1224
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGottlieb, Eric-
dc.date.accessioned2008-02-27T00:06:24Z-
dc.date.available2008-02-27T00:06:24Z-
dc.date.issued2008-02-27T00:06:24Z-
dc.identifier.urihttp://hdl.handle.net/10267/1224-
dc.descriptionThis syllabus was submitted to the Rhodes College Office of Academic Affairs by the course instructor.en_US
dc.description.abstractWe 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.en_US
dc.language.isoen_USen_US
dc.publisherMemphis, Tenn. : Rhodes College-
dc.rightsRhodes College owns the rights to the archival digital images in this collection. Objects are made available for educational use only and may not be used for any non-educational or commercial purpose. Approved educational uses include private research and scholarship, teaching, and student projects. Original copies of the programs are stored in the Rhodes College Archives. In all instances of use, acknowledgement must be given to Rhodes College Archives Digital Repository, Memphis, TN. For information regarding permission to use this image, please email the Archives at archives@rhodes.edu-
dc.subjectMathematics and Computer Science, Department ofen_US
dc.subjectSyllabusen_US
dc.subjectCurriculumen_US
dc.subjectAcademic departmentsen_US
dc.subject1998 Fallen_US
dc.titleCOMP 394-01, Automata Theory, Fall 1998en_US
dc.typeTexten_US
Appears in Collections:Course Syllabi

Files in This Item:
File Description SizeFormat 
1998_fall_COMP_394-01.pdf23.93 kBAdobe PDFThumbnail
View/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.