Scribd
Upload
36 views4 pages

AFL Course Plan _Activity Calendar_Tanik

The document outlines the course CS21003: Automata Theory and Formal Languages at KIIT University for the session Aug-Dec 2023, detailing the course objectives, lesson plan, and evaluation methods. It covers topics such as automata theory, formal languages, regular expressions, context-free grammars, and Turing machines. The document also includes information on textbooks, reference materials, online resources, and an activity calendar for assessments.

Uploaded by

pradeep.39422
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
36 views4 pages

AFL Course Plan _Activity Calendar_Tanik

The document outlines the course CS21003: Automata Theory and Formal Languages at KIIT University for the session Aug-Dec 2023, detailing the course objectives, lesson plan, and evaluation methods. It covers topics such as automata theory, formal languages, regular expressions, context-free grammars, and Turing machines. The document also includes information on textbooks, reference materials, online resources, and an activity calendar for assessments.

Uploaded by

pradeep.39422
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/ 4

CS21003: Automata Theory and Formal Languages

School of Computer Engineering,


KIIT Deemed to be University, Bhubaneswar
Session: Aug-Dec, 2023
Credit: 4

Instructor:
Name : Tanik Saikh
Email : [email protected]
Contact No. : 9831149864

Course Objective:
 To know about Chomsky hierarchy for organizing languages
 To introduce concepts in automata theory and theory of computation
 To identify different formal language classes and their relationships
 To design grammars and recognizers for different formal languages
 To understand undecidability and decide on languages that are undecidable

Day Wise Lesson Plan:


Topics Lecture
No.
MODULE-1
Preliminaries: Set, Symbol, Alphabet, String, Functions and Relations
on Strings, Language, Formal Languages 1.

Introduction to Automata, Classification of Automata and languages


2.

Description and definition of Deterministic Finite Automata (DFA)


3.
DFA with examples Lect.-1 4.
DFA with examples Lect.-2 5.
DFA with examples Lect.-3 6.
DFA with examples Lect.-4 7.
DFA with examples Lect.-5 8.
Description and definition of Non- Deterministic Finite
Automata (NFA), DFA vs. NFA 9.
Design of NFA Examples Lect.-1
Design of NFA Examples Lect.-2,
Language accepted by DFA, NFA (without ∈-transitions) 10.

Languages accepted by NFAs (with ∈-transitions) 11.


Conversion from NFA without ∈- transitions to DFA 12.
Conversion from NFA with ∈-transitions i.e. ∈- NFA to DFA 13.
Minimization of DFA 14.
MODULE-2
Description of Regular Expression (RE) 15.
Conversion from Regular expression to NFA 16.
Conversion from DFA to RE using State Elimination Method 17.

Closure properties of Regular language Lect.-1 18.


Closure properties of Regular language Lect.-2 19.
Pumping lemma for Regular Language 20.
Proof a language is regular or not by Pumping Lemma 21.

MODULE-3
Description of Regular grammar with examples Lect.-1 22.

Regular grammar with examples Lect.-2 23.


Conversion between Right Linear Grammar (RLG), Left Linear 24.
Grammar (LLG) And vice-versa

MID SEMESTER
Context Free Grammar (CFG) and Context Free Languages (CFL) 25.

Find Leftmost Derivation (LMD), Rightmost Derivation (RMD), 26.


Derivation Tree of String from a given Grammar

Ambiguous Grammar and Check whether the grammar is 27.


ambiguous or not.
Inherently Ambiguous Grammar and Example
Conversion from Ambiguous to Unambiguous Grammar 28.

Conversion from Context free languages (CFL) to Context free 29.


Grammar(CFG) and Find Languages generated by CFG

Simplification of CFG i.e. Simplified Grammar 30.


a) Removal of 𝜆- production
b) Removal of Unit production
c) Removal of Useless symbol
More examples of Simplification of CFG 31.
Description of Chomsky Normal Form(CNF) 32.
Conversion from CFG to CNF examples

Conversion from CFG to CNF more examples 33.


Description of Greibach Normal Form(GNF) 34.
Conversion from CFG to GNF examples
Conversion from CFG to GNF more examples 35.
MODULE-4
Introduction to PDA 36.
PDA with examples Lect.-1 37.
PDA with examples Lect.-2 38.
Instantaneous Description (ID) of PDA 39.
Conversion from CFG to PDA 40.
Pumping lemma theorem for CFL 41.
Closure Properties of CFL Lect.-1 42.
Closure Properties of CFL Lect.-2 43.

MODULE-5
Introduction to Turing Machine (TM) 44.
Turing Machine Examples with examples Lect.-1 45.
Turing Machine Examples with examples Lect.-2 46.
Instantaneous Description (ID) of TM
Recursive Languages vs. Recursively Enumerable Languages 47.
Chomsky classification of Grammar & Languages.
Introduction to Undecidability, Undecidable problems about TMs 48.

END SEMESTER
Course Outcome: At the end of the course, the students will be able to:
CO1: Acquire a fundamental understanding of the core concepts in automata
theory and formal languages
CO2: Design finite automata or regular expression for any tokenization task

CO3: Construct a context free grammar for parsing any language


CO4: Design Turing machine for any language
CO5: Conclude the decidable / undecidable nature of any language
CO6: Apply mathematical and formal techniques for solving real-world problems

Text books:
Introduction to automata theory, languages and computations, John E.Hopcroft,
Jeffery D.Ullman, Pearson Education, 3rd Edition. (PDF)
Reference Books:

1. An Introduction to Formal Language and Automata, Peter Linz, Jones & Bartlett
Publishers, 6th Edition. (PDF)
2. Elements of the theory of computation, Lewis, Harry R. and Christos H.
Papadimitriou Prentice- Hall Englewood, 2nd Edition. (PDF)
3. Introduction to the Theory of Computation, Michel Sipser, Thomson
Brooks/Cole, 2nd Edition. (PDF)
4. Theory of computer science by KLP Mishra & N. Chandra Sekharan ,PHI, 3rd
edition. (PDF)

Online Resources:
1. https://nptel.ac.in/courses/111/103/111103016/:by Dr.K.V.Krishnaand,
Dr.D.Goswami, IIT Guwahati
2. https://nptel.ac.in/courses/106/106/106106049/:by Prof.K.Krithivasan, IIT
Madras
3. https://nptel.ac.in/courses/106/105/106105196/:by Prof.S.Mukhopadhyay,
IIT Kharagpur
4. https://www.ics.uci.edu/∼goodrich/teach/cs162/notes/:by Prof.M.T.Goodrich,
University of California, Irvine, USA

Activity Calendar:

ACTIVITY TYPE TENTATIVE DATE MARKS CO


SL.NO.
1. Class Test-1 25th August-30th August 5 CO1
2. Assignment-1 15th September-20th September 5 CO2
3. Quiz-1 5th October-10th October 5 CO3
MID SEM EXAM (16th October-21st October)
4. Class Test-2 10th November-15th November 5 CO4
5. Assignment-2 25th November-30th November 5 CO5
6. Quiz-2 5th December-9th December 5 CO6
END SEM EXAM (18th December-23rd December)

Grading Policy:
 Assignments/quizzes/activities: 30 Marks
 Mid-semester exam: 20 Marks
 End-semester exam: 50 Marks

You might also like