COMP 454 - Automata, Lang & Comput

Description

Hours: Three hours lecture in the lab per week Prerequisites: MATH 300 Study of the relation of languages (i.e. sets of strings) and machines for processing these languages, with emphasis on classes of languages and corresponding classes of machines. Phrase structure languages and grammar. Types of grammars and classes of languages. Regular languages and finite state automata. Context-free languages and pushdown automata. Unrestricted languages and Turing Machines. Computability models of Turing, Church, Markov, and McCarthy. Applications to programming languages, compiler design, and program design and testing.

Meeting Information

Status: Closed
Class Number: 1340
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Dates: 8/26/2017 - 12/22/2017
Grading: Letter Grade

Class Availability

Information below is 24 hours old.
Enrollment Total: 30
Available Seats: 0
Wait List Capacity: 10
Wait List Total: 0

Textbook / Other Materials

Enrollment Information

• Upper Division

Notes