Formal Language and Automata Theory

The Objective of this course is to enable understudies to understand and Study the boundaries between complete and incomplete models of computation. And to Study the properties of classes of solvable and unsolvable problems.
This is a short term course with following Contents: Mathematical Concepts, Formal Languages, Context Free Grammars, Parsing, Normal Forms, Automata, Deterministic Finite Automata, Nondeterministic Finite Automata, Regular and Nonregular Languages File, Pushdown Automata File, Deterministic Parsing: LL(k) Grammars, Turing Machines, Wrap up. The Student Can Learn to have a solid understanding of models of computation, the limits that are imposed by the very nature of computation, and the ubiquity of unsolvable problems.