-
Institution:
-
New Jersey Institute of Technology
-
Subject:
-
-
Description:
-
Prerequisites: CIS 241 or MATH 226 and CIS 280. This course provides an introduction to automata theory, computability theory, and complexity theory. Theoretical models such as finite state machines, pushdown stack machines, and Turing machines are developed and related to issues in programming language theory. Also, the course covers undecidability and complexity theory, including the classes P and NP. Effective Until: Summer 2006
-
Credits:
-
0.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(973) 596-3000
-
Regional Accreditation:
-
Middle States Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2026 AcademyOne, Inc.