Scribd
Upload
17 views

FLAT Syllabus

Uploaded by

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

FLAT Syllabus

Uploaded by

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

INFORMATION TECHNOLOGY

With effect from the AY: 2024-25


22ITC12
FORMAL LANGUAGES AND AUTOMATA THEORY
Instruction 3L Hours per week
Duration of SEE 3 Hours
SEE 60 Marks
CIE 40 Marks
Credits 3

Pre-requisites: Discrete Mathematics, Data Structures, Design and analysis of algorithms

Course Objectives:
The objectives of this course are,
1. Study abstract computing models namely Finite Automata, Pushdown Automata, and Turning
Machines.
2. Introduce various grammars, formal languages and equivalence between various languages and their
corresponding recognizers.
3. Familiarize with decidability and undecidability of computational problems.

Course Outcomes:
Upon completion of this course, students will be able to:
1. Build Deterministic, Nondeterministic Finite automata for Languages and show the acceptance of
strings using Formal Machines.
2. Develop regular expressions and their equivalent finite automata for various languages.
3. Demonstrate context-free grammar, check the ambiguity of grammar and Test for Closure Properties
and Decision Properties of CFL’s.
4. Construct pushdown automata for languages and Analyze Equivalence of PDA’s, CFG’s.
5. Design Turing Machines, Analyze and distinguish between decidable and undecidable problems.

CO-PO Articulation Matrix


PO/PSO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO 1 2 1 1 - 1 - - - - 1 - - 2 - 2
CO 2 2 1 1 - 1 - - - - - - - 1 - 2
CO 3 2 1 1 - 1 - - - - - - - 1 - 2
CO 4 2 1 1 - 1 - - - - - - - 1 - 2
CO 5 2 1 1 - 1 - - - - 1 - - 1 - 2

UNIT-I
Automata: Introduction to Finite Automata, the Central Concepts of Automata Theory: Alphabets, Strings and
Languages.
Finite Automata: Deterministic Finite Automata, Nondeterministic Finite Automata, Equivalence of NFA and
DFA, Finite Automata with Epsilon -Transitions, Minimization of DFA’s.

UNIT-II
Regular Expression and languages: Regular Expressions, Finite Automata and Regular Expression: From
DFAs to Regular Expressions, Converting Regular Expressions to Automata, Applications of Regular
Expressions, Algebraic Laws for Regular Expressions.
Properties of Regular Languages: The pumping lemma for Regular Languages, Applications of Pumping
Lemma, Closure Properties of Regular Languages, Decision Properties of Regular Languages.

UNIT- III
Context Free Grammars and Languages: Context-Free Grammars, Leftmost and Rightmost Derivations, The
language of a Grammar, Constructing Parse Trees, The Yield of a Parse Tree, Applications of CFGs,
Ambiguous Grammars, Removing Ambiguity From Grammars.

Chaitanya Bharathi Institute of Technology (A)


INFORMATION TECHNOLOGY

Properties of Context Free Languages: Normal Forms for Context-Free Grammars: Eliminating Useless
Symbols, Computing the Generating and Reachable Symbols, Eliminating Epsilon Productions, Eliminating
Unit Productions, Chomsky Normal Form, Greibach Normal form, Pumping Lemma for CFL’s, Applications of
Pumping Lemma for CFL’s, Closure Properties of CFL’s, Decision Properties of CFL’s.

UNIT-IV
Pushdown Automata: The Formal Definition of PDA, Graphical Notation for PDA’s, Instantaneous
Description of a PDA, The Language of a PDA: Acceptance by Final State, Acceptance by Empty Stack,
Equivalence of PDA’s and CFG’s: From Grammars to PDA’s, From PDA’s to Grammars, Deterministic
Pushdown Automata.
Context-sensitive Languages: Context-sensitive grammars (CSG), linear bounded automata and equivalence
with CSG.

UNIT-V
Introduction to Turing Machines: Notation for the TM, Instantaneous Descriptions for TM’s, The Language
of a TM, Turing Machines and Halting, Extensions to the Basic Turing machine, Restricted Turing machines,
Turing Machines and computers.
Un decidability: Codes for Turing Machines, The Diagonalization Language, The Universal Language, Un
decidability of the Universal Language, Un decidable problems about Turing Machines: Rice’s Theorem and
Properties of RE languages, Post’s Correspondence Problem: Definition of PCP, The Modified PCP, Other Un
decidable Problems.

Text Book:
1. John E. Hopcroft, Rajeev Motwani, Jeffery D Ullman, “Introduction to Automata Theory Languages
and Computation”, 3rd Edition, Pearson Education, 2015.

Suggested Reading:
1. John C Martin. “Introduction to Language and Theory of Computation”, 3rd Edition, TMH, 2003.
2. Daniel Cohen, “Introduction to Computer Theory”, 2nd Edition, Wiley Publications, 2007.
3. Mishra K., Chandrasekaran N., “Theory of Computer Science (Automata, Languages and
Computation)”, 3rd Edition, Prentice Hall of India 2008.
4. ShyamalendraKandar, “Introduction to Automata Theory, Formal Languages and Computation”,
Pearson, 2013.

Web Resources:
1. http://courses.cs.vt.edu/cs4114/spring2012/index.php
2. http://online.stanford.edu/course/automata-theory

Chaitanya Bharathi Institute of Technology (A)

You might also like