SEM/YEAR : IV SEM

COURSE CODE : 16CS205

TITLE OF THE COURSE : FINITE AUTOMATA AND FORMAL LANGUAGES

L: T/A:P: C : 3 : 2 : 0 : 4

Course Objectives

The course begins with the basic mathematical preliminaries and goes on to discuss the general theory
of automata, properties of regular sets and regular expressions, and the basics of formal languages.
Besides, sufficient attention is devoted to such topics as pushdown automata, context- free languages,
Turing machines

Course outcomes

At the end of the course student will be able

1. To understand the concept of Automata

2. To explain the concept of Regular Expression, languages and abstract machines to recognize them

3. To know the generalized computation model and different types Computation

Module – 1

Introduction to Finite Automata: Study and Central concepts of automata theory, An informal picture of
finite automata, deterministic and non-deterministic finite automata,

applications of finite automata, finite automata with epsilon – transitions 9Hrs

Module – 2

Regular expression and languages: Regular expressions, finite automata and regular expressions,
algebraic laws of regular expressions. applications of regular expressions such as Grep, and Lex etc..

Properties of Regular Languages: closure properties of regular languages, Pumping Lemma, equivalence
and minimization of automata 12Hrs

Module 3

Context – free Grammars and Languages: Context free grammars, Context-free languages,Parse trees,
Ambiguity in grammars and languages Pushdown Automata: Pushdown automation (PDA), the language
of PDA, equivalence of PDA’s and CFG’s, Deterministic Pushdown Automata, 10hrs
Module 4

Properties of Context – Free Languages: Normal forms of context free grammars, pumping lemma for
context free languages, closure properties of context free languages. Applications of CFG - such as spec
of programming languages, parsing techniques, and Yacc 9hrs

Module 5

Introduction to Turing Machine- The Turing machine, programming techniques for Turing machine,
extensions to the basic Turing machine, restricted Turing Machines, Turing Machines and Computers.
Chomsky hierarchy 10 hrs

Text Books

1. Daniel I. A. Cohen, Introduction to Computer Theory, 2nd Edition, Wiley India Student Edition, 2008

2. J.E. Hopcroft , R. Motwani, and J. D. Ullman, Introduction to Automata Theory Languages and
Computation, 3rd Edn. Pearson Education , New Delhi 2008

Reference Books

1. K.L.P. Misra and N. Chandrashekaran. Theory of Computer Science- Automata, Languages and
Computation, 3rd Edn. PHI, New Delhi, 2007

2. C. Martin - Introduction to Languages and the Theory of Computation 2ndEdn, TMH, New Delhi, 2000.