Scribd
Upload
66 views14 pages

Finite Automata: Presented By: Burooj Ghani 2008ECS37 Vivek Sethi 2008ECS50

This document discusses finite automata. It defines a finite automaton as a 5-tuple consisting of a finite set of states, a finite input alphabet, an initial state, a set of accepting states, and a transition function. It explains that a finite automaton processes an input string symbol by symbol according to the transition function to reach an accepting or non-accepting state. The document provides examples of deterministic finite automata and discusses how to construct a finite automaton for the union or intersection of two languages.

Uploaded by

burooj
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
66 views14 pages

Finite Automata: Presented By: Burooj Ghani 2008ECS37 Vivek Sethi 2008ECS50

This document discusses finite automata. It defines a finite automaton as a 5-tuple consisting of a finite set of states, a finite input alphabet, an initial state, a set of accepting states, and a transition function. It explains that a finite automaton processes an input string symbol by symbol according to the transition function to reach an accepting or non-accepting state. The document provides examples of deterministic finite automata and discusses how to construct a finite automaton for the union or intersection of two languages.

Uploaded by

burooj
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

FINITE AUTOMATA

Presented By:
Burooj Ghani 2008ECS37
Vivek Sethi 2008ECS50
What is Automaton/Automata?

An automata is defined as a system where


energy, materials, and information is
transformed, transmitted and used for
performing some functions without direct
participation of man e.g. automatic machine
tools, automatic packing machines etc.
Different types of Automata
• An automata in which the output depends only on
the input is called an automata without memory.
• An automata in which the output depends only
upon the states of the machine is called a Moore
machine.
• An automata in which the output depends upon
the input as well as the states is called the
automata with finite memory or Finite automata.
• An automata in which the output depends upon
the state and the inputs at any instant of time is
called a Mealy machine
A Finite automaton, or a finite state machine (FA) is a 5-tuple (Q, Σ, , q0, F),where :

• Q is a finite set of states.


• Σ is a finite alphabet of input symbols.
• q0  Q (The initial state).
• F  Q is the set of accepting states.
•  : Q  Σ → Q is the transition function
from Q  Σ to Q. the transition function
What exactly is Finite Automata?
q0 q1 q2 q3 ………………………………………………….qf
Input string
a b b a a a b b a

Finite
Control

Finite Automata is a machine that is used to process the


input string reading a symbol one by one untill it does
not reach to a accepting or non-accepting state. It has a
read control head(Finite control) to process the string
according to the function defined(Transition Function),
it jumps from one state to another with the help of this
function(δ).
Let us take an Example
to illustrate it further
11 1
0
0,1
1
0111 111 1
0 0

Read string left to right 1

The machine accepts a string if the process


ends in a double circle
A Deterministic Finite Automaton (DFA)

states
0 q1 1
0,1
1
q0 q2
0 0
1
q3 states

The machine accepts a string if the process


ends in a double circle
A Deterministic Finite Automaton (DFA)

states accept states (F)


0 q1 1
0,1
1
q0 q2
0 0
1
start state (q0) q3 states

The machine accepts a string if the process


ends in a double circle
UNIONS AND INTERSECTIONS.
Theorem:
The union of two regular languages is also a
regular language.
Theorem:
The intersection of two regular languages is also
a regular language.
FINDING AN FA OF UNION AND
INTERSECTION OF LANGUAGES.
FOR Finite Automata M1. FOR Finite Automata M2
Q1 is the set of states. Q2 is the set of states.

q1 is the initial state. q2 is initial state.

A1 is the set of final states. A2 is the set final states.

Σ is set of input symbols. Σ is set of input symbols.


FOR FINITE AUTOMATA OF (L1 U L2) .

(Q1XQ2) is the set of states.

(q1,q2) is the initial state.

(p,q) is the set of accepting states.

Σ is the set of input symbols.


EXAMPLE:
Draw an FA of the language (L1 U L2) where
L1={x|00 is not a substring of x}

L2={x|x ends with 01}.

You might also like