Year:

Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

COURSE PLAN
Target 45% (marks)
Level-1 35% (population)
Level-2 45% (population)
Level-3 55% (population)

1. Method of Evaluation

UG PG
Quizzes/Tests, Assignments (30%) Quizzes/Tests, Assignments, seminar
(50%)
Mid Examination (20%) End semester (50%)
End examination (50%)

2. Passing Criteria

Scale PG UG

Out of 10 point SGPA – “6.00” in each semester SGPA – “5.0” in each semester
scale CGPA – “6.00” CGPA – “5.0”
Min. Individual Course Grade – Min. Individual Course Grade –
“C” “C”
Course Grade Point – “4.0” Course Grade Point – “4.0”

*for PG, passing marks are 40/100 in a paper

*for UG, passing marks are 35/100 in a paper

3. Pedagogy
 Fully Online
 Blackboard Collaborate synchronous sessions (70%)
 Blackboard LMS for asynchronous sessions (30%)
 Online Assessment (Quizzes, Class Test, Assignment)
 Non-Gradable assessments/feedback

4. References:
Text Books Web resources Journals Reference
books
T1: John E. 1. http:// Journal of R1: John C
Hopcroft, Automata,
www.cse.iitb.ac.in/ Martin,
Jeffery Ullman, Languages and
“Introduction to ~trivedi/courses/cs208/ Combinatorics “Introduction
Automata
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

theory lecture01.pdf to languages

Languages &
2. http:// and theory
Narosa
computation” www.cse.iitd.ernet.in/ of
Publishers.
~sak/courses/toc/toc- Computation
T2: K.L.P
recursive-function- ”, McGraw
Mishra & N.
theory.pdf Hill.
Chandrasekara
3. http:// R2: Daniel
n, “Theory of
textofvideo.nptel.iitm.ac.i
I.A. Cohen,
Computer n/106106049/lec1.pdf
“Introduction
Science”, PHI
to Computer
Learning.
Theory”,
Wiley India.
R3: Kohavi,
”Switching &
Finite
Automata
Theory”,
TMH
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

GUIDELINES TO STUDY THE SUBJECT

Instructions to Students:

1. Go through the 'Syllabus' in the Black Board section of the web-site

(https://learn.upes.ac.in) in order to find out the Reading List.
2. Get your schedule and try to pace your studies as close to the timeline as
possible.
3. Get your on-line lecture notes (Content, videos) at Lecture Notes section.
These are our lecture notes. Make sure you use them during this course.
4. Check your blackboard regularly
5. Go through study material
6. Check mails and announcements on blackboard
7. Keep updated with the posts, assignments and examinations which shall be
conducted on the blackboard
8. Be regular, so that you do not suffer in any way
9. Cell Phones and other Electronic Communication Devices: Cell phones
and other electronic communication devices (such as Blackberries/Laptops)
are not permitted in classes during Tests or the Mid/Final Examination. Such
devices MUST be turned off in the class room.
10.E-Mail and online learning tool: Each student in the class should have an
e-mail id and a pass word to access the LMS system regularly. Regularly,
important information – Date of conducting class tests, guest lectures, via
online learning tool. The best way to arrange meetings with us or ask specific
questions is by email and prior appointment. All the assignments preferably
should be uploaded on online learning tool. Various research papers/reference
material will be mailed/uploaded on online learning platform time to time.
11.Attendance: Students are required to have minimum attendance of 75% in
each subject. Students with less than said percentage shall NOT be allowed to
appear in the end semester examination.

This much should be enough to get you organized and on your way to having a great
semester! If you need us for anything, send your feedback through e-mail
[email protected]. Please use an appropriate subject line to indicate your message
details.
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

There will no doubt be many more activities in the coming weeks. So, to keep up to
date with all the latest developments, please keep visiting this website regularly.

RELATED OUTCOMES
1. The expected outcomes of the Program are:

Engineering knowledge: Apply the knowledge of mathematics,

PO1 science, engineering fundamentals, and an engineering
specialization to the solution of complex engineering problems.
Problem analysis: Identify, formulate, review research
PO2 literature, and analyze complex engineering problems reaching
substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.
Design/development of solutions: Design solutions for
complex engineering problems and design system components
PO3
or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural,
societal, and environmental considerations.
Conduct investigations of complex problems: Use research-
PO4 based knowledge and research methods including design of
experiments, analysis and interpretation of data, and synthesis
of the information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate
PO5 techniques, resources, and modern engineering and IT tools
including prediction and modeling to complex engineering
activities with an understanding of the limitations.
The engineer and society: Apply reasoning informed by the
PO6 contextual knowledge to assess societal, health, safety, legal and
cultural issues and the consequent responsibilities relevant to
the professional engineering practice.
PO7 Environment and sustainability: Understand the impact of
the professional engineering solutions in societal and
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

environmental contexts, and demonstrate the knowledge of, and

need for sustainable development.
PO8
Ethics: Apply ethical principles and commit to professional
ethics and responsibilities and norms of the engineering practice.

Individual and team work: Function effectively as an

PO9
individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
Communication: Communicate effectively on complex
engineering activities with the engineering community and with
PO10
society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective
presentations, and give and receive clear instructions.
Project management and finance: Demonstrate knowledge
and understanding of the engineering and management
PO11
principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary
environments.
Life-long learning: Recognize the need for, and have the
PO12
preparation and ability to engage in independent and life-long
learning in the broadest context of technological change.

2. The expected outcomes of the Specific Program are:

Perform system and application programming using computer

PSO1 system concepts, concepts of Data Structures, algorithm
development, problem solving and optimizing techniques,
Apply software development and project management
PSO2 methodologies using concepts of front-end and back-end
development and emerging technologies and platforms.
Ability to create & develop most efficient solutions by applying
PSO3 machine learning with analytical emphasis on industrial and
research problems.

3. The expected outcomes of the Course are:

On completion of this course, the students will be able to

Comprehend regular grammar and regular expressions using

CO 1
Finite-State Automata
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

CO 2 Demonstrate relationship between automata and regular sets.

Construct Pushdown Automata and Turing Machines to accept

CO 3 input based on appropriate grammar.

CO 4 Analyze problems for solvability and decidability.

4. Co-Relationship Matrix
Indicate the relationships by1- Slight (low) 2- Moderate (Medium) 3-Substantial
(high)

Progra
m
Outcom
PSO1

PSO2

PSO3
PO10

PO11

PO12

es
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

Course
Outcom
es
CO 1
3 2 2 2
CO 2
3 2 2 2
CO3
3 2 3 2
CO4
3 2 3 2
Averag 2.
e 3 2 2
5
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

5. Course outcomes assessment plan:

compon Assign Qui
ents Tes
ment z Mid
t End
Semes Any other
Course Semester
1 2 1 2 1 2 ter
Outcomes

CO 1     
CO 2      
CO 3    
CO 4    

OVERVIEW OF COURSE DELIVERY/BROAD PLAN OF COURSE COVERAGE

Course Activities:
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

Planned
Serial Course Outcomes No. of
Unit
No Addressed From To Sessio
ns

1 I CO1 6

2 II CO1,CO2 18

3 III CO3 6

4 IV CO3 6

5 V CO3, CO4 6

6 VI 6
CO4

BROAD PLAN OF COURSE COVERAGE

Synchronous/Asynchronous Session Plan
Actual Delivery Assignment(s)/
Quizzes/ Tests
Course No.
SESSIO
TOPIC Outcomes
N of
Addressed From To
Sessi
ons

UNIT -1

L1 Defining language, CO1

automata theory
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

L2 Kleene closures,
Introduction to Arithmetic CO1
Expressions
L3 Introduction to Formal
Language Theory, CO1 6
Application and
Limitation
L5 Define Grammar, CO1
Chomsky Hierarchy
L6 Transition graph, Quiz1
generalized transition CO1
graph
UNIT-2

L1, L7 Types of FA - DFA, NFA, CO1

Differences
L8 Construction of FA-DFA, CO1
NFA
L9 Construction of NFA CO1
with E-moves
L10 Conversion of NFA with
E-moves to without E- CO1
moves
L11 Conversion of NFA to CO1
DFA
L12 Minimization of Automata CO1

L13 Class Test1

L14 FA with output: Moore CO1

machine, Mealy machine
L15 Equivalence of Moore and Assignment – 1
Mealy Machines, CO1
Limitations of FA 18
L16 Designing of Mealy CO1
Machine
L17 Designing of Moore CO1
Machine
L18 Introduction to Regular CO2
Expressions (RE).
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

L19 Introduction to Regular CO2

Languages-Examples
L20 Equivalence of FA With CO2
RE
L21 Arden Theorem CO2

L22 Arden Theorem-

CO2
Examples

L23 Pumping Lemma for

CO2
regular expressions

L24 Myhill-Nerode theorem

CO2
and its Examples

MID SEM

Unit-3

L25, L5 Context free grammar :

Ambiguity, Simplification CO3
of CFGs

L26 Normal forms for CFGs CO3

L27 Normal forms for CFGs CO3

L28 Pumping Lemma for CO3 6

CFLs

L29 Decidability of CFGs, CO3

L30 Ambiguous to CO3 Quiz2

Unambiguous CFG

UNIT-4

L31 Description and

definition, Working of CO3
PDA,
L32 Acceptance of a string by CO3
PDA,
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

L33 PDA and CFG-Examples CO3

L34 PDA and CFG-Examples CO3 6

L35 Introduction to auxiliary CO3

PDA
L36 Two stack PDA CO3

UNIT-5

L37 Basic model, definition CO4 Assignment – 2

L38 Representation, Language CO4

acceptance by TM
L39 TM and type 0 grammar CO4

L40 Halting problem of TM, CO4 6

L41 Modifications in TM CO4

L42 Universal TM CO4

UNIT-6

L43 Properties of recursive

and recursively CO4
enumerable languages,
L44 unsolvable decision CO4
problem
L45 Undecidability of Post CO4
6
correspondence problem
L46 Recursive function theory CO4

L47 Church’s Thesis CO4

L48 Gödel Numbering. CO4 Test 2

* Session marked with yellow Shade can be conducted in Asynchronous mode using Blackboard LMS. All
other sessions will be in Synchronous mode using Blackboard Collaborate.
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

SESSION PLAN
UNIT-I

Lectur CO
Topics to be Covered
e No. Mapped
1 Introduction to defining language, automata CO1
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

2 Kleene closures, Introduction to Arithmetic Expressions CO1

3 Introduction to Formal Language Theory, Application and Limitation CO1

4 Define Grammar, Chomsky Hierarchy CO1

5 Transition graph, generalized transition graph CO1

SESSION PLAN
UNIT-II
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

CO
Lectur
Topics to be Covered Mappe
e No.
d
Types of FA - DFA, NFA, Differences
1 CO1

2 Construction of FA-DFA, NFA with E-moves -NFA CO1

3 Conversion of NFA with E-moves to without E-moves CO1

4 Conversion of NFA to DFA CO1

5 Minimization of Automata CO1

FA with output: Moore machine, Mealy machine
6 CO2
Equivalence of Moore and Mealy Machines, Limitations of FA
7 CO2
Designing of Mealy and Moore Machine
8 CO2
Introduction to Regular Languages-Examples, Equivalence of FA With
9 CO2
RE
Arden Theorem, Pumping Lemma for regular expressions
10 CO2
Myhill-Nerode theorem and its Examples
11 CO2

SESSION PLAN
UNIT-III

Lectur CO
Topics to be Covered
e No. Mapped
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

1 Context free grammar : Ambiguity, Simplification of CFGs CO3

2 Normal forms for CFGs, CO3

3 Pumping Lemma for CFLs, CO3

4 Decidability of CFGs, CO3

5 Ambiguous to Unambiguous CFG CO3

SESSION PLAN
UNIT-IV

Lectur CO
Topics to be Covered
e No. Mapped
1 Description and definition, Working of PDA, CO3
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

2 Acceptance of a string by PDA, CO3

3 PDA and CFG CO3

4 Introduction to auxiliary PDA CO3

5 Two stack PDA CO3

 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

SESSION PLAN
UNIT-V

CO
Lectur
Topics to be Covered Mappe
e No.
d
1 Basic model, definition CO4

2 Representation, Language acceptance by TM CO4

3 TM and type 0 grammar CO4

4 Halting problem of TM, Modifications in TM CO4

5 Universal TM CO4

SESSION PLAN
UNIT-VI

Lecture CO
Topics to be Covered
No. Mapped
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

1 Properties of recursive and recursively enumerable languages. CO4

Unsolvable decision problem, Empty and Non

2 CO4
Empty language, rice theorem

3 Undecidability of Post correspondence problem CO4

4 Church’s Thesis, Recursive function theory, CO4

5 Gödel Numbering. CO4

PERIODIC MONITORING
Actual date of completion and remarks, if any
 Year:
Semester:

1. Name of the Faculty: Rahul Kumar Singh Course

Code: CSEG 2035P
2. Course : Formal language and automata theory L: 4
3. Program : B.Tech (CSE + AI&ML) T:
4. Target : Level-2 P:
C: 4

Components From To From To From To

Duration (Mention from and to dates)
Percentage of Syllabus covered
Planned
Lectures
Taken
Planned
Tutorials
Taken
Planned
Taken
CO's
Test/quizzes
Addressed
CO's
Achieved
Planned
Taken
CO's
Assignments
Addressed
CO's
Achieved
Signature of Faculty
Head of the Department
A.M.R.C

Signature of HOD/ Dean Signature of

Faculty

Date Date:
 Year: 2 (Aug-Dec 2021)
Semester: 3

5. Name of the Faculty: Dr. Anurag Jain

Course Code: CSEG 2035P
6. Course : Formal Languages and Automata Theory L: 04
7. Program : B. Tech. CSE (Honors) T: 00
8. Target : 45% P: 00
C: 04

PERIODIC MONITORING
Attainment of the Course (Learning) Outcomes:

Componen Attainment Action plan Remark

ts level (AMC)
CO1:
Assignme CO2:
nt CO3:
CO4:
CO1:
CO2:
Quiz/test
CO3:
CO4:
CO1:
Mid CO2:
Semester CO3:
CO4:
CO1:
End CO2:
Semester CO3:
CO4:
CO1:
CO2:
Any Other
CO3:
CO4:

Signature of HOD/ Dean Signature of

Faculty

Date Date:
 Year: 2 (Aug-Dec 2021)
Semester: 3

5. Name of the Faculty: Dr. Anurag Jain

Course Code: CSEG 2035P
6. Course : Formal Languages and Automata Theory L: 04
7. Program : B. Tech. CSE (Honors) T: 00
8. Target : 45% P: 00
C: 04

Sample format for Indirect Assessment of Course outcomes

NAME:
ENROLLMENT NO:
SAP ID:
COURSE:
PROGRAM:

Please rate the following aspects of course outcomes of formal language and Automata Theory.
Use the scale 1-4*
Sr. No. CO 1 2 3 4

1 Comprehend regular grammar and regular

expressions using Finite-State Automata.
2 Demonstrate relationship between automata and
regular sets.

3 Construct Pushdown Automata and Turing

Machines to accept input based on appropriate
grammar.

4 Analyze problems for solvability and decidability.

* 1 Below Average 3 Good

2 Average 4 Very Good