Formal Languages and Automata Theory (CS 302)

2021 Spring
Faculty of Engineering and Natural Sciences
Computer Sci.& Eng.(CS)
6.00 / 6.00 ECTS (for students admitted in the 2013-14 Academic Year or following years)
Kemal ─░nan,
Click here to view.
Formal lecture,Interactive lecture
Interactive,Learner centered,Communicative
Click here to view.


Introduction to languages, grammars and computation, Chomsky hierarchy, Regular languages and regular expressions, finite state automata and nondeterminism, automata determinization and minimization, pumping lemma and closure properties for regular languages, context free languages and grammars, push- down automata, pumping lemma for context-free languages, closure properties of context-free languages.


To introduce finite state machines , contex free grammars and Turing Machines (only on an introductory level) and their properties as the basis for the formal expressivity of computer languages and present algorithms and their computational complexity for solving linguistic decision problems .


Construct deterministic and nondeterministic finite state automata (DFA and NFA) for solving simple decision problems and perform conversions from nondeterministic to deterministic finite automata as well as between regular expressions and finite state automata.

Evaluate the computational complexity of algorithms involved in the decision problems of finite state automata, use the pumping lemma to demonstrate the non-regularity of languages
Compute the minimal state machine corresponding to a DFA,
Understand and construct context-free grammars (CFG) for formal definitions involving recursion such as regular expressions ; in particular understand the fundamental role played by CFG in designing formal computer languages with simple examples
Construct (infinite state) push down automata as acceptors of context free languages ; in particular compute from CFGs the corresponding push down automaton and vice versa
Use the CFG version of the pumping lemma to prove languages that are not context free
Evaluate the computational complexity of algorithms involved in the decision problems of context free grammars and push down automaton, classify and simplify grammars into their useful canonical forms
Use deterministic push down automata to parse formal language strings (computer programs) by using (i) top down or (ii) bottom up techniques
Formulate simple language manipulation techniques using Turing Machines
In general ,learn and master the use mathematical induction techniques in proving statements on formal language and automata theory


  Percentage (%)
Final 35
Midterm 20
Exam 35
Assignment 10



MAIN TEXT: Introduction to Automata Theory, Languages and Computation , Hopcroft, Motwani & Ullman, Pearson (Addison Wesley) 2006 , 3rd edition


AUXILIARY TEXT : Elements of the Theory of Computation, Lewis & Papadimitrious, Prentice Hall 1998 (out of print and discontinued)