COM 1621 - Theory of Computation

Institution:

Yeshiva University

Subject:

Computer Science (UM)

Description:

Deterministic and nondeterministic finite state automata; regular grammars and regular expressions; equivalence of regular expressions and finite automata; pumping lemma for regular languages; context free grammars; languages generated by context free grammars; parse trees and ambiguity; Chomsky normal form; pushdown automata; equivalence of context free grammars and pushdown automata; pumping lemma for context free languages; Turing machines; Universal Turing machine; Halting problem; solvable and unsolvable problems about automata and languages; introduction to complexity theory; NP-complete problems.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.yu.edu

Phone Number:

(212) 960-5400

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.