**CS 476
Automata Theory and Formal Languages
**

**Description:**
Classification of automata and formal languages. Finite state
machines, regular languages and their limitations. Tape
automata. Pushdown automata and context free languages. Normal form
grammars. Turing machines, halting problem, and
unsolvability. Computable functions and predicates. Algorithms and
effective computability. Recursive functions. *Credit units: 3*,
*Prerequisite: CS 201*.

**Spring'2001 Semester:**

- Syllabus
- Quizzes
- Homework 1 Due: February 27, 2001
- Homework 2 Due: April 3, 2001
- Homework 3 Due: May 1, 2001
- Grades
- JFLAP: Java Formal Languages & Automata Package