CSE 355, Intro Theory of CS
Spring 07

Instructor: G. Farin
BY 346

Office hours: MW 2-3
(+ by appointment)

TA's: DonglinXia, dxia2@asu.edu, BY 498AC, 1-2, TuFr,

Ling Zhou, Ling.Zhou@asu.edu, BY498AB, 1-2, Th

Materials

class log

current grades

text errata

Syllabus: Languages, automata, grammars, Turing machines, computability

Grading: 4 homework assignments (50%), 1 midterm(25%), 1 final(25%). Grades: 97+=A+, 90+=A, 87+=B+, 80+=B, 70+=C, 60+=D, 50+=E.

All homework will be submitted as .pdf or .doc documents to either one of the TAs (no scans of handwritten work). Late work will be penalized at 5% per day.

All tests and projects will be handled according to ASU's rules of academic integrity.

Text: T. Sudkamp. Languages and Machines. Addison-Wesley, 2005 (3rd ed.)

JFLAP home  
  Homework 1 Homework2 Homework3 Homework4
JFLAP.jar MockMidterm Midterm solutions MFinal MFinalSols FinalSols