[Home] [Modules] [Syllabus] [Office Hours]

Syllabus

Instructor: Karen Lemone
http://www.cs.wpi.edu/~kal

This course provides an introduction to the theoretical issues of computer science. Computer science theory includes the various models of finite state machines, both deterministic, nondeterministic, and concepts of decidability and formal language theory.

CS3133 Objectives

1. Produce proofs to substantiate selected computer science topics

2. Perform computations with automata

3. Create automata for various languages and computations

4. Distinguish between regular and context-free languages

5. Construct grammars for programming language constructs

6. Describe properties of various languages classes

7. Distinguish between decidable and undecidable problems

Grading

The grading system doesn't like fractions so we will divide the final course grade by 10 to get a percentage relative to 100

    Homeworks: 350 Points (Each homework is worth 50)
    Midterm Exam: 350 Points
    Final Exam: 300 Points

Text

In addition to the text, I strongly encourage you to read the material posted in eaach module.

Sudkamp: Languages and machines http://www.aw-bc.com/catalog/academic/product/0,1144,0321322215,00.html

Office Hours

TBA