Scribd
Upload
46 views18 pages

FAFL-Final-Lecture 2.1

Uploaded by

shruthi g
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
46 views18 pages

FAFL-Final-Lecture 2.1

Uploaded by

shruthi g
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

Established as per the Section 2(f) of the UGC Act, 1956

Approved by AICTE, COA and BCI, New Delhi

Lecture 2.1
Introduction to Automata
School of Computing and Information
Technology
Ms. Shruthi G
[email protected]

AY:2020-2021
OUTLINE
Recap of Previous Lecture

Topic of the Lecture

Objective and Outcome of Lecture

Lecture Discussion

• Definition of Theory of Automata


• Components of Automata
• Classifications of Automata
• The Simple Automaton – Example
• Basics of Automata Theory
Introduction to Automata
Recap of Previous Lecture
RECAP OF PREVIOUS LECTURE

Importance of Finite Automata and Formal Languages

Prerequisites

Course Description
Description

Course Objectives

Course Outcomes

Course Contents

Learning Resources

Additional Resources
RECAP OF PREVIOUS LECTURE

Companies working on Applications of Automata theory

Real World Applications

Job Roles in Industry

Type of Assignments

Quiz

Pedagogy

Marks Distribution

Course Delivery
Introduction to Automata
Topic of the Lecture
TOPIC OF THE LECTURE

• Definition of Theory of Automata


• Components of Automata
Introduction to
• Classification of Automata
Automata
• The Simple Automaton – Example
• Basics of Automata Theory
Introduction to Automata
Objective and Outcome of Lecture
OBJECTIVE AND OUTCOME OF LECTURE

• Explain the basics of Automata theory, its classification


Lecture
and the central concepts of Automata theory namely
Objective Alphabet, String and Languages.

• Outline and identify the basics of Automata theory its


Lecture
classifications and the central concepts of Automata
Outcome theory namely Alphabets, Strings and Languages.
Introduction to
Automata
Definition of Theory of
Automata
DEFINITION OF THEORY OF AUTOMATA

What is Theory of Computation…?

Just like the laws of physics tell us what is (im)possible for nature
to do... ...the laws of computation tell us what is (im)possible for
computers.

It is the study of the inherent capabilities and


limitations of computers.
Automata theory is the study of laws of
computation.
Introduction to Finite Automata
Components of Automata
COMPONENTS OF AUTOMATA

Computation

CPU MEMORY Temporary


Memory

Temporary Memory Example: f(x) = x3 Input


z=2*2=4 Memory
f(x) = z * 2 = 8 Input Memory
x=2 CPU

CPU
Output Memory Output
f(x) = 8 Program Memory
Program Memory
Memory
Compute x * x
Compute x2 * x Automaton
Introduction to Finite Automata
Classification of Automata
COMPONENTS OF AUTOMATA

Temporary STACK Random Access Memory


Memory Input
(LIFO Ordering)
Input Input
Memory Memory Memory
Finite Push Down Turing
Automaton Output Automaton Output Machine Output
Memory Memory Memory

Finite Automaton Push Down Automata Turing Machine


Example: Vending Machines Example: Compilers for Example: Any Algorithm
(small computing power) Programming Languages (highest computing power)
(medium computing power)

Low computation Power Medium computation Power


High computation Power
Introduction to Finite
Automata
A Simple Automaton -
Example
A SIMPLE AUTOMATON -
EXAMPLE

Automata Representing Electrical Switch Automata Recognizing Relational Operator


DISCUSSION
5 MINUTES
Can a Finite Automata be constructed to represent an Electrical circuit
consisting of two switches?

You might also like