27-460 Elements of Theory of Computation F(3-0) |
An introduction to finite automata, formal languages and sequential machines. Models of computation, including Turing machines and the hierarchy of machines/languages. Decidability and computability. |
Prerequisites: 27-349, 27-360. |
1996-97 Undergraduate Calendar |
Last revised: August 28, 1996. Contact: ccrenna@registrar.uoguelph.ca.