COT 6315 Formal Languages and Computation Theory

Last modified 2004.08.24

Instructor: Richard Newman

NEWS,

Objectives:

A study of the formal relationships between machines, languages and grammars; we will cover regular, context-free, context-sensitive, recursive and recursive enumerable languages along with undecidability and intractability.

Prerequisites

Discrete mathematics (elementary graph theory, elementary set theory, proof techniques), Data structures.

Grading

Syllabus

is available online.

Course Outline Topics

In addition, I will maintain a list of questions and answers, a list of list of hints, and a planned schedule.

Interesting and Relevant Sites


This document is copyright 2004 by Richard E. Newman.
Send comments to nemo@cise.ufl.edu