CS 3186 - Introduction to Automata Theory

(3)

This course is repeatable: No
Max # of units may be repeated: 0
Total # of units allowed for credit: 3
Max times this course can be taken for credit: 1

Description Formal approach to automata theory; finite state machines, regular expressions, regular languages, context free languages and Turing machines. Develops mathematical foundation for computer science.

Grading: ABCDF
Mode of Delivery: Face to Face, Hybrid
Campus: Main Campus

Prerequisite(s): CS 2013, CS 2148
Needs Permission to Enroll: No
Special Fee Applied: No

GE UD B (restricted to specific majors)
.

Quicklinks Search Form

Search form

University Catalog

CS 3186 - Introduction to Automata Theory