-
Institution:
-
Tuskegee University
-
Subject:
-
-
Description:
-
2nd Semester. Lect. 3, 3 credits. Mathematical models for algorithmic processes and finite automata. Theory of automata, decidability, formal languages, turing machines, computational complexity, and NP-completeness. Application of theoretical approaches to practical problems. Prerequisites: CSCI 0230 and CSCI 0300 or Departmental Approval.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(334) 727-8011
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.