CSIS 616 - Automata Theory

Institution:

College of Charleston

Subject:

Computer And Information Scien

Description:

The theory of finite state machines and regular expressions are applied to the design of switching circuits, components of compilers such as lexical analysis, pattern-matching, text editors, unifications as needed in Prolog or for automated deduction, and almost any program which processes under commands. Undecidable problems and intractable problems are explored. NOTE: Please refer to the appropriate academic catalog for additional course information concerning prerequisites, co-requisites and course restrictions.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.cofc.edu

Phone Number:

(843) 953-5500

Regional Accreditation:

Southern 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.