Office Hours:
        10:00 -11:00 MWF
        11:00 - 12:00 Tu
        others by appointment

Text: An Introduction to Formal Languages and Automata, 5th Edition by Linz

Class web page: http://phoenix.goucher.edu/~jillz/cs250

Course Description and Goals: We will discuss the theoretical foundations of computer science, stressing formal models. We will introduce formal computational complexity and alternate models of computation. Topics include finite state machines, regular expressions, grammars, pushdown automata, Turing machines, computability and the halting problem, and hierarchies of computational classes.

This is a mathematically and theoretically oriented course and will require extensive problem solving and class participation. We will cover the entire text.

The goal of the course will be to try to understand the underlying foundations of computational theory. Familiarity with the major models, the relationships between them, and an ability to reason with them is essential for further study in computer science.

Course Objectives:

• Formulate abstractions and construct and use mathematical models of computation
• Write clear and logical arguments to mathematical problems

Course Mechanics:  Instead of a traditional lecture approach, you will be presented with questions which will generate class discussions.  We will be using socrative.com (room 44772) where you will each "vote" on an answer.  Prior to the vote you will have a short time to work through the question by yourself, followed by a longer period of time in discussion with a partner.  Try to convince your partner of your answer if you disagree!

In addition, you will be have labs using the free software tool JFLAP.  You will want to bring your text to class every day.

No late homework will be accepted.
Academic dishonesty will not be tolerated. (See the Honor code for definition and disposition of academic dishonesty.)

Grading
        2 Exams (20% each) 40%
        Comprehensive Final 20%
        Labs/Homework 40%