CS 306 - Automata Theory and Programming Languages

Institution:

Knox College

Subject:

Description:

Automata theory (finite machines, Turing machines, regular expressions, context-free languages); computability theory (decidable and undecidable languages, problems that are solvable and not solvable by computers); complexity theory (time and space complexity of algorithms, NP-completeness, intractability); a critical study of the design issues that underlie modern programming languages including the study of lexical and syntactic analysis and the important programming paradigms. Prereq: CS 142 and MATH 175; D. Bunde

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.knox.edu

Phone Number:

(309) 341-7000

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Trimester

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.