CMPSC 138 - Automata and Formal Languages

Institution:

University of California-Santa Barbara

Subject:

Computer Science

Description:

Formal languages; finite automata and regular expressions; properties of regular languages; pushdown automata and context-free grammars; properties of context-free languages; introduction to computability and unsolvability. Introduction to Turing machines and computational complexity.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.ucsb.edu

Phone Number:

(805) 893-8000

Regional Accreditation:

Western Association of Schools and Colleges

Calendar System:

Quarter

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.