Online Course Catalog
CS 475 - Formal Models of Computation
Fall 2024
| Title | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|
| Formal Models of Computation | DSO | 41803 | ONL | 4 | - | Mahesh Viswanathan |
Course Description
Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; linear-bounded automata and context-sensitive languages; computability and the halting problem; undecidable problems; recursive functions; Chomsky hierarchy; computational complexity are covered in this course.
Credit Hours
3 or 4 hours
Subject Area
- Computer Science