 |
CS 470 - 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 Chomsky Hierarchy. Prerequisite: CS 232. College: Sciences & Humanities Hours: 3 Permission: Y Prerequisite: CS 232 Co-requisite: none |
Copyright © 2008 Ball State University 2000 W. University
Ave. Muncie, IN 47306