CS3101 Theory of Formal Languages and Automata

This course will cover the Chomsky hierarchy of Formal Languages (regular sets, context-free languages, context-sensitive languages, and recursively enumerable languages) and the types of grammars and automata associated with each class in the hierarchy. Emphasis is placed on the major results of the theory as they apply to language and compiler design. In addition, the major results involving the concept of in decidability are covered.

Prerequisite

CS3001

Lecture Hours

4

Lab Hours

1

Quarter Offered

  • Fall
  • Spring