CSCI 616 - Automata

Institution:

The Citadel

Subject:

Computer Science

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.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.citadel.edu

Phone Number:

(843) 225-3294

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.