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.
Units: 3.00
Grading: Letter Grade
| Session | Section | Class # | Type | Days | Time | Location | Instructor | Course Details [Key] |
|---|---|---|---|---|---|---|---|---|
| 1 | 01 | 1837 | LEC | W | 07:00 PM - 08:00 PM | Online | Michael Soltys |
|
Key for Course Detail Icons
 = Course Open |
= Course Closed |
= Course Details |
 = Textbook Info |
 = General Education |
 = Extended University |
 = Service Learning |
 = In Person |
 = Asynchronous Online |
 = Synchronous Online |
= Synchronous/Asynchronous |
 = Blended |
 = No Cost Course Materials |
 = Low Cost Course Materials |