FORMAL LANGUAGES AND

AUTOMATION THEORY

Lecture #0
The kick start session
 VISION

To be a globally recognized school through excellence in

teaching, learning and research for creating Computer
Science professionals, leaders and entrepreneurs of future
contributing to society and industry for sustainable growth.
 MISSION

• To build computational skills through hands-on and practice-based

learning with measurable outcomes.
• To establish a strong connect with industry for in-demand
technology driven curriculum.
• To build the infrastructure for meaningful research around societal
problems.
• To nurture future leaders through research-infused education and
lifelong learning.
• To create smart and ethical professionals and entrepreneurs who are
recognized globally
MAIN PERSPECTIVE

Why are we learning Automata Theory?

What would we do with it?

WHY STUDY AUTOMATA THEORY

There are numerous applications of Formal languages and Automata

Theory like:

Text processing, Compilers and Hardware Design

Motors and Vending machines

Sensors and Transducers

Automata Simulators

And many more ….

UNIT 1: FINITE AUTOMATA

A finite automaton is a mathematical model that :

• reads input symbols and

• changes states based on predefined transition rules.

UNIT 2: REGULAR EXPRESSIONS AND REGULAR SETS

Regular expressions describe Regular sets are the sets of strings

patterns of strings accepted by finite automata defined by
those patterns.
 UNIT 3: FORMAL LANGUAGES

A formal language in finite automata is a:

• set of strings formed from a finite alphabet and

• defined by specific grammatical rules or automata.

UNIT 4: CONTEXT-FREE LANGUAGES

A context-free language is a set of strings generated by a context-

free grammar,
where production rules have a single non-terminal on the left-
hand side.
 UNIT 5: PUSHDOWN AUTOMATA AND PARSING

A Pushdown Automaton (PDA) is a finite

automaton equipped with a stack for
additional memory.

A real-life application of a Pushdown

Automaton (PDA) is syntax checking in
compilers,
UNIT 6: TURING MACHINES

A Turing Machine is a mathematical

model of computation that uses an
infinite tape and a head to read,
write, and change states based on
rules.

Real-life application of Turing

Machines is in cryptography,
COURSE CONTENTS

Unit 1 FINITE AUTOMATA: Definition and Description of a Finite Automaton, Deterministic and
Non deterministic Finite State Machines, Transition Systems and Properties of Transition Functions,
Acceptability of a String by a Finite Automaton, The Equivalence of DFA and NDFA, Mealy and
Moore Machines, Minimization of Finite Automata, Basics of Strings and Alphabets, Transition Graph
and Properties of Transition Functions, Regular Languages, The Equivalence of Deterministic and Non
deterministic Finite Automata

Unit 2 REGULAR EXPRESSIONS AND REGULAR SETS: Regular Expressions and Identities for
Regular Expressions, Finite Automata and Regular Expressions: Transition System Containing null
moves, NDFA with null moves and Regular Expressions, Conversion of Non-deterministic Systems to
Deterministic Systems, Algebraic Methods using Arden's Theorem, Construction of Finite Automata
Equivalent to a Regular Expression, Equivalence of Two Finite Automata and Two Regular Expressions,
Closure Properties of Regular Sets, Pumping Lemma for Regular Sets and its Application, Equivalence
between regular languages: Construction of Finite Automata Equivalent to a Regular Expression,
Properties of Regular Languages, Non-deterministic Finite Automata with Null Moves and Regular
Expressions, Myhill-Nerode Theorem
COURSE CONTENTS

Unit 3 FORMAL LANGUAGES: Derivations and the Language Generated by a Grammar,

Definition of a Grammar, Chomsky Classification of Languages, Languages and their Relation,
Recursive and Recursively Enumerable Sets, Languages and Automata, Chomsky hierarchy of
Languages REGULAR GRAMMARS: Regular Sets and Regular Grammars, Converting
Regular Expressions to Regular Grammars, Converting Regular Grammars to Regular
Expressions.
Unit 4 CONTEXT- FREE LANGUAGES: Ambiguity in CFG, Leftmost and rightmost
derivations, Language of a CFG, Sentential forms, Applications of CFG, Pumping Lemma for
CFG, Derivations Generated by a Grammar, Construction of Reduced Grammars, Elimination
of null and unit productions, Normal Forms for CFG: Chomsky Normal Form
SIMPLIFICATION OF CONTEXT- FREE GRAMMARS : Construction of Reduced
Grammars, Greibach Normal Form
COURSE CONTENTS

Unit 5: PUSHDOWN AUTOMATA AND PARSING : Description and Model of Pushdown

Automata, Representation of PDA, Acceptance by PDA, Pushdown Automata: NDPDA and
DPDA, Context free languages and PDA, Pushdown Automata and Context-Free Languages,
Comparison of deterministic and non- deterministic versions, closure properties, LL (k)
Grammars and its Properties, LR(k) Grammars and its Properties, PARSING: Top-Down and
Bottom-Up Parsing.
Unit 6: TURING MACHINES AND COMPLEXITY: Turing Machine Model, Representation
of Turing Machines, Design of Turing Machines, The Model of Linear Bounded Automaton,
Power of LBA, Variations of TM, Non-Deterministic Turing Machines, Halting Problem of
Turing Machine, Post Correspondence Problem, Basic Concepts of Computability, Decidable
and Undecidable languages, RECURSIVELY ENUMERABLE LANGUAGE, Computational
Complexity: Measuring Time & Space Complexity, Power of Linear Bounded Automaton,
Variations of Turing Machine, Cellular automaton
COURSE OUTCOMES

• Understand concepts and Abstractions for Automata as a Fundamental

Computational Model
• Understand algebraic formalisms of languages such as regular expressions,
context-free grammar.
• Compare different types of Grammars and design context free grammars
for formal languages
• Analyze the properties and structure of context-free languages
• Understand the construction of Push Down Automata, including closure
properties and their relationship with parsing techniques.
• Understand algorithms and computability through the lens of Turing
machines and relationship between various computational models.
PROGRAM OUTCOMES

• CSE 322 contributes most strongly to PO1–PO5, and moderately to PO9–PO12.

• PO1::Apply the knowledge of mathematics, science, engineering fundamentals, and

an engineering specialization to the solution of complex engineering problems.

• PO2::Identify, formulate, review research literature, and analyse complex engineering

problems reaching substantiated conclusions using first principles of mathematics,
natural sciences and engineering sciences.

• PO3::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::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.
PROGRAM OUTCOMES

• PO5::Create, select, and apply appropriate techniques, resources, and modern

engineering and IT tools including prediction and modelling to complex engineering
activities with an understanding of the limitations.

• PO6::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::Understand the impact of the professional engineering solutions in societal and

environmental contexts, and demonstrate the knowledge of, and need for sustainable
development

• PO8::Apply ethical principles and commit to professional ethics and responsibilities

and norms of the engineering practice.
PROGRAM OUTCOMES

• PO9::Function effectively as an individual, and as a member or leader in diverse teams,

and in multidisciplinary settings

• PO10::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::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
manage projects and in multidisciplinary environments.

• PO12::Recognize the need for, and have the preparation and ability to engage in
independent and lifelong learning in the broadest context of technological change.
PROGRAM SPECIFIC OUTCOMES

PSO1: Apply acquired skills in software engineering, networking, security, databases,

intelligent systems, cloud computing and operating systems to adapt and deploy innovative
software solutions for diverse applications.

• PSO2: Apply diverse IT skills to design, develop, and evaluate innovative solutions for
business environments, considering risks, and utilizing interdisciplinary knowledge for
efficient real-time projects benefiting society.
REVISED BLOOM’S TAXONOMY
RUBRICS FOR EVALUATION

CA MCQs BASED in OFFLINE MODE

ETE MCQs BASED in OFFLINE MODE

Education Revolution
25th Academic Session of
LPU
 Why EDU-Revolution!!!
Career Readiness
Enhance Real World Skills
Promote Innovation and Creativity
Foster Industry Relations
Develop Entrepreneurial Mindset
Increase Student Engagement and Motivation
Promote Lifelong Learning
EDU-REVOLUTION (MOOCS)

COURSE NAME: THEORY OF COMPUTATION

Link: https://onlinecourses.nptel.ac.in/noc25_cs121/preview
Online Educational Resources

Course Code Course Unit mapped Broad topic OER Type Title of OER *%age unit Source
Title mapped with URL
OER
(approx)
Unit 1 Reading CSE322 80% https://www.sea
FINITE
material (Pdf ) s.upenn.edu/~cis
AUTOMATA 2620/notes/cis26
2sl1-aut.pdf

CSE322 Unit 2 REGULAR Reading CSE322 80% https://www.sea

material (Pdf ) s.upenn.edu/~cis
Formal Languages EXPRESSIO NS 2620/notes/cis26
AND 2sl1-aut.pdf
and Automation
REGULAR SETS
Theory
Unit 3 FORMAL -- CSE322 70% https://www.cs.col
ostate.edu/~masse
LANGUAGE S
y/Teaching/cs301/
RestrictedAccess/Sl
ides/301lecture05.
pdf
Online Educational Resources

Course Course Title Unit Broad topic OER Type Title of *%age unit Source URL
Code mapped OER mapped with
OER
(approx)
Unit 4 -- CSE322 90% https://www3.cs.stony
CONTEXT- brook.edu/~pramod.ga
FREE napathi/doc/theory-of-
computation/ContextFr
LANGUAGE S eeGrammars.pdf

Unit 5 -- CSE322 90% https://www3.cs.ston

CSE322 PUSHDOWN
ybrook.edu/~pramod
AUTOMATA AND
Formal Languages and PARSING
.ganapathi/doc/theor
y-of-
Automation Theory computation/Context
FreeGrammars.pdf

https://www3.cs.ston
Unit 6 TURING -- CSE322 70%
ybrook.edu/~pramod
MACHINES .ganapathi/doc/theor
AND y-of-
computation/Turing
COMPLEXITY Machines.pdf
SKILL SET

SKILL BASED LEARNING

Analytical Skills
Problem Solving
TEXT/ REFERENCE BOOK

Text Book

Theory of Computer Science: Automata, Languages and

Computation

Author: KLP Mishra and N. Chandrasekaran

 Semester Exchange a t LPU LPU’s International Credit Transfer Summer/Winter School Program
LPU’s Semester Exchange Program allows students to study abroad The LPU International Credit Transfer Program allows students to begin
their studies at LPU and seamlessly transfer to complete their degree at a This program allows to spend 2-4 weeks for cultural exposure at
for one semester at a partner institution.
partner university
foreign partner university

100% Scholarship Apply During Bachelor’s Degree Master’s Degree

(On overseas Tuition Fees) 2+2 1+1
(Applicable in most cases)
Feb/Aug

Duration Eligibility 1st & 2nd Year at LPU 1st Year at LPU
6 CGPA
One Semester (No reappear/backlog)

3rd & 4th Year at 2nd Year at Foreign

Avg. Budget Foreign University University
Final Degree 2.5 to 5 Lakh INR
From LPU (Living & Travel
Experience)
Final Degree from the Foreign Partner University

M B A students went to Chungnam National University,

south korea for winter school program
 Want to go global?
Scan to explore more!

INTERNATIONAL CREDIT SEMESTER EXCHANGE P R O G R A M ENQUIRY

TRANSFER P R O G R A M ENQUIRY FORM
F ORM
FOR MORE DETAILS, VISIT BLOCK 32-310,
Division of International Affairs
Your Seniors Went Global—Are You Next?