Scribd
Upload
16 views

Updated_Lecture 0

Uploaded by

Saroj Pathak
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
16 views

Updated_Lecture 0

Uploaded by

Saroj Pathak
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 26

CSE322

Formal Languages and Automation


Theory
Lecture #0
Course details

• LTP – 3 0 0 [Three
lectures/week]

• Text Book
• Theory of Computer
Science: Automata,
Languages and
Computation
• Author: KLP Mishra and N.
Chandrasekaran
Cohort for CSE322

Software Development
Course Assessment Model
1. >=90% -- 5 marks
2. >=85% and <90% -- 4
marks

• Marks break up
3. >=80% and <85%
marksCA would be of 30
Each
-- 3

• Attendance
4. marks.
>=75% Best
marks
and <80%
2 would be
taken at the end (60
-- 2

5MTE would
marks) which be of 40
would be
prorated
marks and itoutwould
of 25 be
• CA(Best
ETE would be 2out
of 70 of 3)
prorated to 20 at the
marks25and it would be
end
prorated to 50 at the
• MTE end
20
• ETE 50
• Total
100
Detail of Academic Tasks

CSE322
• AT1: Test1 Lecture #11
(Before MTE)

• AT2: Test2 Lecture #19 (Before


MTE)

• AT3: Test3 Lecture #33 (After


MTE)
Note: All AT’s are subjective and test based
• MOOCS:

Theory of Computation (8 Weeks) -NPTEL

https://nptel.ac.in/courses/106104028

Exemptions: Complete Course


The course contents

• UNIT 1 - Finite automata

• UNIT 2 - Regular expressions and regular


sets

• UNIT 3 - Formal languages and regular


grammars

• UNIT 4 - Context- free languages and


simplification of context-free grammar

• UNIT 5 - Pushdown automata and parsing

• UNIT 6 - Turing machines and complexity


Main Perspective

The three main perspective are:

•Why are we learning Automata Theory?

•What would we do with it?

•What will be the course outcome?


Why Study Automata Theory?
• Automata theory tells very important
equivalence between
•
a language: some -- usually -- infinite set of
strings

• a grammar: the finite set of rules to


generate that language

• an automaton: the abstract processing


device that can recognize that language
Why Study Automata Theory?

 Automata theory is the study of abstract


computational devices

 Abstract devices are (simplified) models of real


computations

 Computations happen everywhere: On your


laptop, on your cell phone, in nature, …

 Why do we need abstract models?


Why Study Automata Theory?
Why Study Automata Theory?
Why Study Automata Theory?

 Such devices are difficult to reason about,


because they can be designed in an infinite
number of ways

 By representing them as abstract


computational devices, or automata, we will
learn how to answer such questions
What would we do with it
? are numerous applications of Formal
There
languages and Automata Theory like:

 Text processing, Compilers and Hardware


Design

 Motors and Vending machines

 Sensors and Transducers

 Automata Simulators

 And many more ….


ATM MACHINE
Motor
Vending machine
UNIT 1
Finite Automata
Regular
UNIT 2 Expressions and
Regular Sets
Formal
UNIT 3 Languages
&Regular Grammar
UNIT 4
Context Free languages and Simplification of
context free grammar
Push
UNIT 5 Down Automata &
Parsing
Turing
UNIT 6 Machine and
Complexity
What will be the course
outcome?
A student completing this course would be able to:
 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.
Let’s Start: Finite Automata

You might also like