Go to Main Content

.

 

HELP | EXIT

Detailed Course Information

 

Fall 2017
Dec 15, 2017
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

CS 380 - Theory of Computation 1
Mathematical logic; alphabets and languages; finite automata, regular and nonregular languages, Kleene's theorem; regular grammars; pushdown automata and context-free grammars; Turing and Post machines; recursive and recursively enumerable languages; the Chomski Hierarchy. Prerequisite: CS 224 with a C- or better grade.
3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture, Online Fixed Times (Synch), Online (Asynchronous)

Computer Science Department

Restrictions:
Must be enrolled in one of the following Levels:     
      Undergraduate
      Graduate

Prerequisites:
Undergraduate level CS 224 Minimum Grade of C- or Undergraduate level CS 324 Minimum Grade of C-

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.1