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
| Days | Times | Room | Meeting Dates | Instructor |
|---|---|---|---|---|
| MW | 12:00 PM - 1:15 PM | Sierra Hall 1131 | 8/22/2015 - 12/21/2015 | Michael Soltys |
Status: Open
Class Number: 2190
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Dates: 8/22/2015 - 12/21/2015
Grading: Letter Grade
Class Availability
Information below is 24 hours old.
Enrollment Total: 23
Available Seats: 1
Wait List Capacity: 5
Wait List Total: 0
Textbook / Other Materials
Status: RequiredISBN: 978-1-133-18779-0
Title: Introduction to the Theory of Computation
Publisher: Cengage Learning
Author: Michael Sipser
More textbook information including prices
Enrollment Information
- Upper Division