-
Institution:
-
Wofford College
-
Subject:
-
-
Description:
-
A study of formal models of computation such as finite state automata, push-down automata, and Turing machines, along with the corresponding elements of formal languages. These models are used to provide a mathematical basis for the study of computability and to provide an introduction to the formal theory behind compiler construction. Prerequisites: Mathematics 181 and C or higher in Computer Science 350. (3/0/3) A. Shiflet, sloan, sykes
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(864) 597-4000
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Four-one-four plan
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.