Name of Institute: IITE, Indus University Ahmedabad

Name of Faculties: Asst. Prof.Shruti Jaiswal, Asst. Prof. Babita Patel,

Asst. Prof. Parth Nirmal

Course code: CS0702

Course name: Formal Language & Automata Theory
Pre-requisites: Basic knowledge of Discrete Mathematics.
Credit points: 3
Offered Semester: 7th

Course Coordinator and Lecturer (weeks 12)

Faculty name with email id :
Asst. Prof.Shruti Jaiswal [[email protected]]
Department with siting location: Computer Science & Engineering Dept., 4th floor
Bhanwar Building.
Consultation times: Monday and Tuesday- 03:00pm to 04:00pm.
*Students will be contacted throughout the Session via Mail with important
information relating to this Course.

Course Objectives

1. To provide a Basic understanding of the Lexical Phase of Compiler Design.

2. To provide the knowledge about Regular Language, and design of Finite Automata.
3. To provide the knowledge about Context Free Language, and
design of Push down Automata.
4. To provide the knowledge about Turing Machine and Complexity.
5. To develop skill among students to design different types of automata and machines.

Course Outcomes (CO)

At the end of this subject, students should be able to:

1. To understand the concepts of Set, Relation and Functions, mathematical

induction & recursive Function and to Design Deterministic finite automata,
Nondeterministic finite automata, conversion of NFA to DFA, design of E-
NFA and regular expressions.
2. Obtain minimized DFA and convert automata to regular expressions and
regular expression to automata and proving languages are not regular.
3. Master context free languages, push-down automata. Student will be able
to write CFG’s, Construction of parse trees, finding and removing
ambiguity in grammars, designing problems on Pushdown Automata.
4. Student will be able to convert grammar to Chomsky Normal Form and
conversion of grammar to PDA.
5. Prove that languages are not context free using pumping lemma.

CS0702, Formal Language & Automata Theory: 7thSem. Page 1 of 9

2025
 6. Student will be able to design Turing Machines, understand the working of
various types of Turing Machines and solving post correspondence
problems be exposed to a broad overview of the theoretical foundation of
computer science.

Course Outline

This course will provide the insights to the various topics related to computation
like Automata, Types of Automata, Grammars, Normal Forms, PDA and Turing
Machines.

CONTENT

UNIT-I

Basics: Sets, Logic formulas, Functions and Relations, Basic mathematical

notations, Basics of alphabet, string, languages and grammars, Mathematical
induction and recursive definitions.
UNIT-II

Regular Languages and Finite Automata: Regular language and regular

expressions, Deterministic finite automata, Minimization of finite automata,
Operations on Finite automata, Nondeterministic Finite Automata, Conversion
of NFA to DFA, NFA-^, Conversion of NFA-^ to NFA and DFA, Kleene’s Theorem,
Pumping lemma for regular Languages.
UNIT-III

Context Free Grammar (CFG): Introduction to CFG, Derivation and Parse

Tree, Ambiguity in CFG, Left factoring and Left Recursion, Simplification of CFG,
Linear grammar, Normal Forms (GNF and CNF), Applications of CFG Push-Down
Automata (PDA): Introduction of PDA, DPDA and NPDA, Construction of PDA
from CFG and vice versa, Parsing.
UNIT-IV

Turing Machines (TM): Introduction to TM, Variations of TM, Non deterministic

TM, Universal TM, Two Stack PDA and Turing machine, Models of Computation
and the Church- Turing Thesis, Types of complexity, Different Notations,
Complexity Classes, P and NP problems, Polynomial time reducibility.

Method of delivery
(Face to face lectures, Online Lectures, self-study material in form of PPT, Active
Learning Techniques)
Study Time

(3 hours theory + 1 hour tutorial per week including class attendance)

CS0702, Formal Language & Automata Theory: 7thSem. Page 2 of 9

2025
CO-PO Mapping (PO: Program Outcomes)

1. Program Outcomes (PO’s)

Engineering Graduates will be able to:

PO1 Engineering knowledge: Apply the knowledge of mathematics,
science, engineering fundamentals, and an engineering specialization to
the solution of complex engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature, and
analyze complex engineering problems reaching substantiated
conclusions using first principles of mathematics, natural sciences,
and engineering sciences.
PO3 Design/development of solutions: Design solutions for complex
engineering problems and design system components or processes that
meet the specified needs with appropriate consideration for the public
health and safety, and the cultural, societal, and environmental
considerations.
PO4 Conduct investigations of complex problems: Use research-based
knowledge and research methods including design of experiments,
analysis and interpretation of data, and synthesis of the information to
provide valid conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools including prediction
and modeling to complex engineering activities with an understanding
of the limitations.
PO6 The engineer and society: Apply reasoning informed by the
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 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.
PO9 Individual and team work: Function effectively as an individual, and
as a member or leader in diverse teams, and in multidisciplinary
settings.
PO10 Communication: Communicate effectively on complex engineering
activities with the engineering community and with 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.
PO11 Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and
apply these to one’s own work, as a member and leader in a team, to

CS0702, Formal Language & Automata Theory: 7thSem. Page 3 of 9

2025
 manage projects and in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the
preparation and ability to engage in independent and life-long learning
in the broadest context of technological change.

2. Programme Specific Outcome

Computer Science & Engineering

1. To understand the principles and working of computer systems.

2. To Design and develop computer programs in the areas related to

algorithms, networking, web design, cloud computing, IoT and data analytics.
C PO PO PO PO PO5 PO PO PO PO PO1 PO1 PO1 PSO1 PS PSO
O 1 2 3 4 6 7 8 9 10 11 12 O2 3

1 √ √ √ √ √ √
2 √ √ √ √ √ √

3 √ √ √ √ √ √
4 √ √ √ √ √ √

5 √ √ √ √ √ √
6 √ √ √

Blooms Taxonomy and Knowledge retention (For reference)

(Blooms taxonomy has been given for reference)

Figure 1: Blooms Taxonomy

CS0702, Formal Language & Automata Theory: 7thSem. Page 4 of 9

2025
 Figure 2: Knowledge retention

Attendance Requirements

The University norms states that it is the responsibility of students to attend all
lectures, tutorials, seminars and practical work as stipulated in the Course
outline. Minimum attendance requirement as per university norms is
compulsory for being eligible for mid and end semester examinations.

Details of referencing system to be used in

written work Text books:

1. Introduction to languages and Theory of Computation by John C. Martin, Third Edition,
TMH
Publication.
2. Introduction to Automata theory, Formal Languages and Computations by
Shyamalendu Kandar, Pearson Publication.
3. Theory of Computer Science by KLP Mishra and N. Chandrasekharan, PHI Publication.

Reference Books

1. Formal Languages and Automata Theory by C.K. Nagpal, Oxford Publication

2. Automata theory, Languages and computation by Hopcroft, Motwani,
Ullman, Pearson Education.
Additional Materials

Web Resources:

1.http://nptel.iitm.ac.in/courses/106104028/
2.http://www.cse.iitb.ac.in/~supratik/courses/cs331/
3.http://nptel.iitm.ac.in/courses/106106049/

CS0702, Formal Language & Automata Theory: 7thSem. Page 5 of 9

2025
 ASSESSMENT GUIDELINES

Your final course mark will be calculated from the following:

Theory:

Mid Sem Exam [40 Marks]

Assignment/classtest/Notebook [15 Marks]
Attendance [05 Marks]

SUPPLEMENTARY ASSESSMENT

Students who receive an overall mark less than 40% in mid semester or end
semester will be considered for supplementary assessment in the respective
components (i.e mid semester or end semester) of semester concerned.
Students must make themselves available during the supplementary
examination period to take up the respective components (mid semester or end
semester) and need to obtain the required minimum 40% marks to clear the
concerned components.

Late Work
Late assignments will not be accepted without supporting documentation. Late
submission of the reports will result in a deduction of 5% of the maximum mark
per calendar day

Format
All assignments must be presented in a neat, legible format with all information
sources corr ectly referenced. Assignment material handed in throughout
the session that is not neat and legible will not be marked and will be
returned to the student.

Retention of Written Work

Written assessment work will be retained by the Course coordinator/lecturer for
two weeks after marking to be collected by the students.

University and Faculty Policies

Students should make themselves aware of the University and/or Faculty Policies
regarding plagiarism, special consideration, supplementary examinations and
other educational issues and student matters.

Plagiarism - Plagiarism is not acceptable and may result in the imposition of

severe penalties. Plagiarism is the use of another person’s work, or idea, as if it is
his or her own - if you have any doubts at all on what constitutes plagiarism,

CS0702, Formal Language & Automata Theory: 7thSem. Page 6 of 9

2025
please consult your Course coordinator or lecturer. Plagiarism will be penalized
severely.

Do not copy the work of other students.

Do not share your work with other students (except where required for
a group activity or assessment)

Course schedule (subject to change)

Teaching Learning
Week # Topic & contents CO Addressed Activity (TLA)

Sets, Logic Formulas, Functions & Chalk & BB

Week 1 1, 6
Relations
Basic to alphabet, string, languages and Chalk & BB
Week 2 grammars, Mathematical induction and 1, 6
recursive definition
Regular language and regular Chalk & BB /
expressions, Deterministic finite Online Session
Week 3 1
automata, Minimization of finite with PPT
automata
Operations on Finite automata, Chalk &
BB/Online
Week 4 Nondeterministic Finite Automata, 1, 2
Session with
Conversion of NFA to DFA
PPT
NFA-^, Conversion of NFA-^ to NFA Chalk &
and DFA, Kleene’s Theorem, Pumping BB/Online
Week 5 1, 2, 3
lemma for regular Languages Session with
PPT
Introduction to CFG, Derivation and Chalk & BB
Week 6 3 /Online Session
Parse Tree, Ambiguity in CFG.
with PPT
Left factoring and Left Recursion, Chalk &
BB/Online
Week 7 Simplification of CFG. 3, 4
Session with
PPT
Linear Grammar, Normal Forms (GNF Chalk &
and CNF), Applications of CFG Push BB/Online
Week 8 4
Down Automata (PDA): Introduction of Session with
PDA. PPT

CS0702, Formal Language & Automata Theory: 7thSem. Page 7 of 9

2025
 DPDA and NPDA, Construction of Chalk &
BB/Online
Week 9 PDA from CFG and vice versa, Parsing. 4
Session with
PPT
Introduction to TM, Variations of TM, Chalk &
BB/Online
Week 10 Non-deterministic TM, Universal TM. 4, 5
Session with
PPT
Two Stack PDA and Turing machine, Chalk &
Models of Computation and the Church BB/Online
Week 11 4, 5
Turing Thesis Session with
PPT
Types of complexity, Different Chalk &
Notations, Complexity Classes, P and BB/Online
Week 12 5, 6
NP problems, Polynomial time Session with
reducibility PPT

CS0702, Formal Language & Automata Theory: 7thSem. Page 8 of 9

2025
 PROGRAM MAP for Bachelor of
Engineering (CE / CSE / IT)

CS0702, Formal Language & Automata Theory: 7thSem. Page 9 of 9

2025