Class Description

CS 315 Automata Theory (3). Finite and infinite models leading to an understanding of computability. Upon completion of this course, students will be familiar with fundamental principles of computability. Familiarity will be gained through the study and use of different families of languages.

Instructor Information:

Dr. Eck Doerry Professor of Computer Science Dept. of Electrical Eng. and Computer Science Northern Arizona University Office: Engineering, Rm 259 Phone: 523-9377 Email: Eck.Doerry@nau.edu Office hours Dr. Doerry's Homepage