COURSE PLAN

Computer Science and Engineering

Department :

Formal Languages and Automata Theory & CSE 2254

Course Name & code :

IV & CSE
Semester & branch :

Dr. Vivekanand Bhat, Mr. Praveen Pai T., Ms. Anita S. Kini,
Ms. Shwetha Rai
Name of the faculty :
L T P C
No of contact hours/week:
2 1 0 3

Course Outcomes (COs)

No. of
At the end of this course, the student should be able to: Contact Marks
Hours
CO1: Understand finite automata and its applications 8 22

CO2: Learn Regular Languages and its applications 7 21

CO3: Learn context free languages and its applicatins 7 21

CO4: Understand push-down automata and its applications 9 24

CO5: Learn Turing Machines and language hierarchy 5 12

Total 36 100

(Page 1 of 5) MIT/GEN/F-01/R2
 Assessment Plan
End Semester/
Components Assignments Sessional Tests
Make-up Examination
Duration 20 to 30 minutes 60 minutes 180 minutes
Weightage 20 % (4 X 5 marks) 30 % (2 X 15 Marks) 50 % (1 X 50 Marks)
Understanding; Applying; Remembering; Understanding;
Typology of Analyzing; Evaluating; Creating Understanding; Applying; Analyzing;
Questions Applying Evaluating; Creating
Answer one randomly selected MCQ (10 marks): Answer all 5 full
question from the problem sheet 10 questions of 0.5 questions of 10 marks
(Students can refer their class marks each each. Each question
Pattern
notes) Short Answers (10 may have 2 to 3 parts
marks): questions of of 3/4/5/6/7 marks
2 or 3 marks
As notified by Associate Director
Schedule (Academics) at the start of each Calendared activity Calendared activity
semester
Assignment 1 (L 1-8 & T y1-y2 ) Test 1 Comprehensive
(CO1) (L 1-13 & T b1-b2 ) examination covering
Assignment 2 (L 9-15 & T y3-y4 ) (CO1& CO2) full syllabus. Students
Topics (CO2) are expected to answer
Covered Assignment 3 (L 16-22 & T y5-y6 ) Test 2 all questions (CO1-5)
(CO3) (L 14-25 & T b3-b4 )
Assignment 4 (L 23-32 & T y7-y8 ) (CO3 & CO4)
(CO4)

Lesson Plan
Course
L. No./
Topics Outcome
T. No.
Addressed
L0 Click or tap here to enter text. CO

L1 INTRODUCTION TO THE THEORY OF COMPUTATION AND FINITE CO1

AUTOMATA
L2 Three basic concepts: Languages, Grammers and Automata CO1
L3 Grammers CO1
L4 Some applications CO1
L5 Dterministic Finite Accepter CO1
L6 Nondeterministic Finite Accepters CO1
L7 Equivalence of Deterministic and CO1
Nondeterministic Finite Accepters
L8 Reduction of the Number of States in Finite CO1
Automata

(Page 2 of 5) MIT/GEN/F-01/R2
L9 REGULAR LANGUAGES, REGULAR GRAMMARS AND PROPERTIES CO2
OF REGULAR LANGUAGES
L10 Regular Expressions CO2
L11 Connection between Regular Expressions and Regular CO2
Languages
L12 Connection between Regular Expressions and Regular CO2
Languages (Contd.)
L13 Regular Grammars CO2
L14 Closure Properties of Regular Languages CO2
L15 Identifying Non-regular Languages CO2
L16 CONTEXT-FREE LANGUAGES AND SIMPLIFICATION OF CO3
CONTEXT-FREE GRAMMARS AND NORMAL FORMS
L17 Context-Free grammars CO3
L18 Parsing and Ambiguit CO3
L19 Context-Free Grammars and CO3
programming language
L20 Methods for Transforming Grammars CO3
L21 Methods for Transforming Grammars (Contd.) CO3
L22 Two important CO3
Normal Forms
L23 PUSHDOWN AUTOMATA AND PROPERTIES OF CONTEXT-FREE CO3, CO4
LANGUAGES
L24 Nondeterministic Pushdown Automata CO4
L25 Pushdown Automata and Context–Free Languages CO4
L26 Pushdown Automata and Context–Free Languages (Contd.) CO4
L27 Deterministic Pushdown Automata and Deterministic Context-Free Languages CO4
L28 Two Pumping Lemma CO4
L29 Two Pumping Lemma (Contd.) CO4
L30 Closure properties of Context-Free Language CO4
L31 TURING MACHINES AND OTHER MODELS OF TURING MACHINES CO5
L32 The Standard Turing Machines CO5
L33 Non-deterministic Turing Machines, Linear Bounded Automata CO5
L34 A HIERARCHY OF FORMAL LANGUAGES & AUTOMATA CO5
L35 Recursive and Recursively Enumerable Languages, Unrestricted grammars CO5
L36 Context-Sensitive Grammars and Languages, The Chomsky Hierarchy CO5

(Page 3 of 5) MIT/GEN/F-01/R2
References:
1. Peter Linz, An Introduction to Formal Languages and Automat, (6e), Jones & Bartlett
Learning, 2016
2. John C Martin, Introduction to Languages and the Theory of Computation, (3e), McGraw
Hill, India, 2007
3. J E Hopcroft, Rajeev Motwani & Jeffrey D Ullman, Introduction to Automata Theory,
Languages and Computation, (3e), Pearson Education, 2006
200
4. K.L.P. Mishra, N.Chandrashekharan, Theory of Computer Science, (3e), PHI publications,
2007
5. Michael Sipser, Theory of Computation, Cengage Learning, 2007

6. Click or tap here to enter text.

7. Click or tap here to enter text.

Submitted by: Dr. Vivekananda Bhat

(Signature of the faculty)

Date: 03-01-2020

Approved by: Dr. Ashalatha Nayak

(Signature of HOD)

Date: 03-01-2020

FACULTY MEMBERS TEACHING THE COURSE (IF MULTIPLE SECTIONS EXIST):

FACULTY SECTION FACULTY SECTION
Ms. Anita S. Kini A
Ms. Shweths Rai B
Mr. Praveen Pai T. C
Dr. Vivekanand Bhat D

(Page 4 of 5) MIT/GEN/F-01/R2
 *********

(Page 5 of 5) MIT/GEN/F-01/R2