Scribd
Upload
103 views1 page

FLAT Curriculum

CS3L001 is a course on Formal Language and Automata Theory taught in the autumn 2017 semester at IIT Bhubaneswar. It will cover topics including grammars, Chomsky's hierarchy, finite state automata, context-free grammars, pushdown automata, Turing machines, and the relationships between formal languages and models of computation. The course will have lectures on Mondays, Tuesdays, and Wednesdays and will be evaluated based on internal assessments, a midterm exam, and an end-term exam. Students are expected to maintain satisfactory attendance as per institute policy.

Uploaded by

PunithRossi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
103 views1 page

FLAT Curriculum

CS3L001 is a course on Formal Language and Automata Theory taught in the autumn 2017 semester at IIT Bhubaneswar. It will cover topics including grammars, Chomsky's hierarchy, finite state automata, context-free grammars, pushdown automata, Turing machines, and the relationships between formal languages and models of computation. The course will have lectures on Mondays, Tuesdays, and Wednesdays and will be evaluated based on internal assessments, a midterm exam, and an end-term exam. Students are expected to maintain satisfactory attendance as per institute policy.

Uploaded by

PunithRossi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

CS3L001: Formal Language and Automata Theory

School of Electrical Sciences


IIT Bhubaneswar
Instructor: Debi Prosad Dogra
E-mail: [email protected]
Autumn 2017
Lecture Schedule: Monday: 8-8:55AM AM, 11:55 AM 12:55 PM, Tuesday: 11 AM-11:55 AM, Wednesday:
2:30 PM 3:25 PM, Venue: 218, SES

Grammars - Production systems Chomskys Hierarchy - Right linear grammar and Finite state
automata - Context free grammars - Normal forms, Derivation trees and ambiguity.

Finite state Automata - Non deterministic and deterministic FSA, NFSA with - moves, Regular
Expressions - Equivalence of regular expression and FSA. Pumping lemma, closure properties and
decidability. Myhill - Nerode theorem and minimization - Finite automata with output.

Pushdown automata - Acceptance by empty store and final state - Equivalence between pushdown
automata and context-free grammars - Closure properties of CFL - Deterministic pushdown automata.

Turing Machines - Techniques for Turing machine construction - Generalized and restricted versions
equivalent to the basic model - Godel numbering - Universal Turing Machine - Recursively enumerable
sets and recursive sets - Computable functions - time space complexity measures - context sensitive
languages and linear bound automata.

Decidability; Post's correspondence problem; Rice's theorem; decidability of membership, emptiness and
equivalence problems of languages.

Time and tape complexity measures of Turing machines; Random access machines; the classes P and NP;
NP-Completeness; satisfiability and Cook's theorem; Polynomial reduction and some NP-complete
problems.

Text Books:
1. J. E. Hopcroft, R. Motwani and J. D. Ullman, "Introduction to Automata Theory Languages and
computation", Pearson Education Asia, 2001.
2. Peter Linz, "An Introduction to Formal Language and Automata", 4th Edition, Narosa Publishing
house, 2006.
Reference:
1. John. C. Martin, "Introduction to the Languages and the Theory of Computation", Third edition,
Tata McGrawHill, 2003.
Evaluation Policy:

Internal (20%), Mid-Term (30%), End-Term (50%)

Internal (20%): Assignments (10%), Quiz (10%)

Attendance: Institutes policy will be followed and you will be deregistered from the course if satisfactory
attendance is not maintained. If you miss two consecutive classes, you need to produce appropriate
letter duly approved by your faculty adviser.

You might also like