Automata Theory And Formal Languages COMP301 FA

This course is an introduction to formalisms studied in Computer Science and mathematical models of computing machines. The language formalisms discussed include regular, context-free, context-sensitive, and recursively enumerable languages. The machines discussed include finite-state, pushdown and linear bounded automata and Turing machines.

MAJOR READINGS

EXAMINATIONS AND ASSIGNMENTS

ADDITIONAL REQUIREMENTS and/or COMMENTS

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

Level: UG Credit: 1.00

Prerequisites: COMP212 and MATH228

Last Updated on MAR-10-1997