Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
43 views

Theory of Automata

The document discusses theory of automata and finite automata. It defines finite automata as a language defining method that uses a finite number of states. Deterministic finite automata are described as having a transition function that maps each state-input pair to exactly one next state, with no null moves. Examples of constructing DFAs are given for languages with specific strings, including providing transition tables. Finite automata are said to be finite because they have a finite number of states.

Uploaded by

Fatima
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
43 views

Theory of Automata

The document discusses theory of automata and finite automata. It defines finite automata as a language defining method that uses a finite number of states. Deterministic finite automata are described as having a transition function that maps each state-input pair to exactly one next state, with no null moves. Examples of constructing DFAs are given for languages with specific strings, including providing transition tables. Finite automata are said to be finite because they have a finite number of states.

Uploaded by

Fatima
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Theory Of Automata

1
Lecture # ….
Theory of Automata

2
Recall…….
 What is Automata?
 It is the plural of automaton, and it means
“something that works automatically”.

3
4
5
Finite Automata
A language defining method
 Also known as Finite State Machine (FSM), Finite

State Automata (FSA) ,State Machines.


 It is just like a ludo in which token changes position

on the input if certain number of dice

6
Finite Automata
 A FA is defined as follows:-
◦ Finite number of states in which one state must be
initial state and more than one or may be none can
be the final states.
◦ Sigma Σ provides the input letters from which
input strings can be formed.

◦ FA Distinguishing Rule: For each state, there


must be an out going transition for each input
letter in Sigma Σ.

7
Types of Finite Automata

8
9
1:Deterministic Finite Automata
 It represents an abstract machine which is used to
represent a regular language

 A regular expression can also be represented using


Finite Automata

 There are two ways to specify an FA:


1) Transition Tables and
2) Directed Graphs.

10
Graphical Representation
Each node (or vertex) represents a state, and the
edges (or arcs) connecting the nodes represent
the corresponding transitions.
Each state can be labeled

11
 DFA consists of 5 tuples {Q, ∑, q, F, δ}.

 Q : set of all states.


 ∑ : set of input symbols. ( Symbols which machine

takes as input )
 q : Initial state. ( Starting state of a machine )
 F : set of final state.
 δ : Transition Function,

defined as δ : Q X ∑ --> Q.

12
 For a particular input character, the machine goes to
one state only.

 Null (or ε) move is not allowed.

 DFA cannot change state without any input


character.

Question: Why FA is said to Finite Automata?

13
Transition Table
STATE INPUT INPUT
0 1
q0 q1 q0
q1 q1 q2
* q2 q2 q2

 The indicates the start state: here q0


 The * indicates the final state(s) (here only one final

state q1)

14
 This defines the following transition diagram

 0 1
q0 q1 q2

 1 0 0,1

15
Examples
1: Construct a DFA for a language L = {aa}

∑ = {a}
L ={aa} (Language with only one string aa)

a a a
q0 q1 q2 D

D= Dead State a

16
2: Construct a DFA for a language L = {aba}

∑ = {a,b}
L ={aba} (Language with only one string aba)

Here ,q4 = Dead state


a

a b a

q0 q1 q2 q3
b
b a,b
a,b
q4
a,b
17
3: Construct a DFA with ∑ = {0, 1} accepts all
strings starts with 0.
Also construct a Transition Table for the this DFA

Hint: First make the language for the above DFA.

18
 Construct a DFA with ∑ = {0, 1} accepts all strings
starts with 0.
 L = {0,00,01,001,011,……..}

0,1
0
q0 q1

0,1
q2

19
Here
 q0 is initial or start state

On getting 0 input it goes to q1


On getting 1 input it goes to q2

 q1 is the final state having self loop (having all


combinations of 0 and 1 strings)

 The state q2 is the Dead State or Trap state.

 Dead State: The strings are trapped in this state and will
not reach the final state and hence not acceptable by DFA

 The strings which reaches the final state will only be


accepted by DFA.
20

You might also like