Course Description

The objective of this course is to introduce fundamental theories of grammar and formal languages, to discuss the relationship between the different classes of languages, and to establish links with machines and algorithms which are capable of recognizing them. We study deterministic and non-deterministic final state automatas, we show that the languages recognized by these are regular languages (regular expressions). We show properties of closure and pumping lemmas. We study context-free grammar as well as different algorithms used for its analysis.