| 401211 - Theory of Computation |
|---|
Credit Hours3 Pre-requisite401111 Co-requisite- Distribution3+0 |
| This course emphasizes theoretical models of computation. The principal objective of this class is to identify and prove the capabilities and limitations of particular models of computation. Models of computation that are covered include finite automata, pushdown automata, and Turing machines. Models of language description such as grammars (regular, context-free, ) are studied. Some complexity theory is covered as well. Complexity classes discuss the type of problems that current computer can handle. Finally, the mathematical concepts that are related to the computability are also introduced. |
- About
- Admissions
- Academics
- Life at AUM
- Scientific Research
- Alumni
- Centers
- Quick Links