FORMAL LANGUAGES AND AUTOMATA THEORY

Department of computer science

Sub Code : 06CS56 IA Marks : 25

Hrs / Week : 04 Exam Hours : 03
Total Hrs : 52 Exam Marks : 100

Class Planned Conducted

Topic to be covered Remarks
no date date
PART – A

UNIT 1 07
1. Introduction to Finite Automata 07/08/09
The central concepts of Automata
theory;
2. Deterministic Finite Automata 10/08/09
Definition of DFA, How a DFA
Process strings,
3. Simpler Notations for DFA, Extending 11/08/09
the transition function to strings. The
extended transition function
4. Exercises problems 12/08/09
5. The language of DFA, Non 14/08/09
deterministic finite automata
6. Definition of NFA, The language of 17/08/09
NFA.
7. Equivalence between nfa an dfa. A Bad 18/08/09
case for subset construction
UNIT 2 07
8. An applications Finite automata 19/08/09
9. Finite automata with epsilon
transitions. Use of epsilon transition, 21/08/09
10. The formal notations for an epsilon nfa,
epsilon closures The extended 24/08/09
transitions and Languages for epsilon
nfa. Eliminating the epsilon transitions.
11. Regular Expression, The operators of
Regular expressions, building the 25/08/09
regular expression, precedence of
Regular expression.
12. Finite automata and regular expression, 26/08/09
From dfa to regular expression
13. Converting DFA to regular expression
by eliminating states. 28/08/09
14. Converting Regular expressions to
automata, an applications of 31/08/09
Regular expressions.
Class Planned Conducted
Topic to be covered Remarks
no date date
PART – A

UNIT 3 06
15 Regular languages, proving languages
not to be regular., the pumping lemma 01/09/09
for Regular Languages.
16 An application of Pumping lemma 02/09/09
17 Closure properties of Regular 04/09/09
languages
18 Decision properties of Regular 07/09/09
Languages: Converting amon
representations, Testing emptiness and
membership in Regular languages.
19 Equivalence and Minimization of 08/09/09
Automata, testing Equivalence of states
20 Minimization of DFA, Why minimized 09/09/09
DFA cannot be beaten.
UNIT 4 06
21 Context- Free grammars and languages
, context free grammars -an informal 14/09/09
example. Definition of CFG, derivation
using a grammar
22 Left and Right most derivation, the
language of a grammar, sentential 15/09/09
forms and related problems.
23 Parse tree: constructing the parse trees,
the yield of a parse tree, inference, 16/09/09
Derivations, and parse trees.
24 From tress to derivations, from
derivations to Recursive inferences. 22/09/09
Application of Context free grammars.
25 Ambiguity in grammars and languages,
Ambiguous grammars, Removing 24/09/09
ambiguity from grammars
26 Left most derivation as a way to
express ambiguity, inherent ambiguity 25/09/09
and relate problems
Class Topic to be covered Planned Conducted Remarks
no date date
PART –B

UNIT 5 07
27 Pushdown automata: Definition of the
pushdown automaton , informal 26/09/09
Introduction, The formal definition of
pushdown automata.
28 A graphical Notations for PDA’s,
instantaneous description of a PDA 29/09/09
29 The languages of a PDA, Accepting by 01/10/09
final states, Acceptance by empty
stack, From empty stack to final state
30 From final state to empty stack. 03/10/09
Equivalence of PDA and CFG, From
grammars to pushdown automaton
31 From PDA to grammars and its related 06/10/09
problems
32 Deterministic pushdown automata 08/10/09
Definition of a DPDA, Regular
languages and DPDA.
33 DPDA and context free languages 09/10/09
DPDA and ambiguous grammars.
UNIT 6 06
34 Properties of Context- Free languages 10/10/09
Normal forms for context free
grammars, Eliminating useless
symbols, computing the generating and
reachable symbols.
35 Eliminating the epsilon production, and 15/10/09
unit production
36 Chomsky normal form. 16/10/09
37 Pumping lemma for CFG, the size of 20/10/09
the parse trees, statement of the
Pumping lemma and application of
CFL.
38 Closure properties of CFL 22/10/09
Substitutions , application of the
substitution theorem
39 Reversal, Intersection with regular 23/10/09
languages, Inverse Homomorphism.
UNIT 7 07
40 Introduction Turing Machine 24/10/09
Problems that cannot solve,
 programs that print “hello world”,
The hypothetical “Hello world
“tester. Reduction one problem to
another
41 The Turing machine, the quest to 27/10/09
Decide All mathematical
questions, Notations for the
Turing machine. Instantaneous
description for Turing machine.
42 Transition diagrams for Turing 29/10/09
machines, The language of a
Turing machine, The Turing
machine and halting.
43 Programming techniques for 30/10/09
Turing machines, Storage in state,
multiple tracks, and subroutines.
44 Extension to basic Turing 31/10/09
machines
Multi tape Turing machines ,
Equivalence of One tape and
multiple TM’s.
45 Running Time and the Many- 03/11/09
Tapes –One construction,
Nondeterministic Turing
machines.
46 Turing machines and computers, 06/11/09
simulating a Turing machine by
computer and by a machines.
Comparing the running time of
computers and Turing machines

UNIT 8 06
47 Undecidablity, A language that is 07/11/09
not Recursively Enumerable,
Enumerating the binary strings,
codes for Turing machines, The
Diagonalization Language.
48 Proof that ld is not recursively 10/11/09
enumerable. An undecidable
problem that is RE,
49 recursive language, complements 12/11/09
of Recursive and RE languages,
The universal languages.
50 Undecidability of the universal 13/11/09
language. Post correspondence
problem, Definition of post
correspondence problems, The
modified PCP
51 Completion of the proof of PCP 14/11/09
Undecidability . Other un
 decidable problems. Problems
about programs
52 Undecidability of ambiguity for 19/11/09
CFG, The complement of a list
languages.

TEXT BOOK TITLE

1. Introduction to Automata Theory, Languages and Computation
– John E.. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman:, 3rd
Edition, Pearson education, 2007.

REF. BOOK TITLE

1. Fundamentals of the Theory of Computation: Principles and
Practice – Raymond Greenlaw, H.James Hoove, Morgan
Kaufmann, 1998.

2. Introduction to Languages and Automata Theory – John C

Martin, 3rd Edition, Tata McGraw-Hill, 2007.
3 Introduction to Computer Theory – Daniel I.A. Cohen, 2nd
Edition, John Wiley & Sons, 2004.

4 An Introduction to the Theory of Computer Science, Languages

and Machines – Thomas A. Sudkamp, 3rd Edition, Pearson
Education, 2006.

Prepared By: Checked By: Approved By:

Darshan L.M Prasad. G Dr. Vishwanath P Baligar