Abstract computation devices, finite automata, pushdown, and linear-bounded automata. Turing Machines, or equivalent, as transducers and as acceptors. Connections with classes of languages and term-rewriting systems. Deterministic and non-deterministic computability. Introduction to logic programming via resolution-unification algorithms.
Credit Weight:
0.5
Prerequisite(s):
Computer Science 2412 and Mathematics 1271
Offering:
0-0; 3-0
Course Classifications:
Type C: Engineering, Mathematical and Natural Sciences