CS 41000 - Automata And Computability

Prerequisite(s): CS 27500 FOR LEVEL UG WITH MIN. GRADE OF C- AND CS 30900 FOR LEVEL UG WITH MIN. GRADE OF C-

Credit Hours: 3.00. A finite automaton is a mathematical model for a computational system. Computer science embodies many examples of finite state systems. This course will cover the basic principles of deterministic and non-deterministic finite automata, Turing machines, formal language theory, regular expressions, context-free grammers, the halting problem, and unsolvability. Typically offered Fall.

View Class Schedule