Scribd
Upload
729 views13 pages

11 Automata - Real Life Examples of Automata

The document discusses examples and definitions related to automata, which are machines that can transition between different states. It provides examples of automata like a digital watch, digicode lock, and modulo 3 counter to illustrate states, transitions, and executions. Formal definitions covered include the components of an automaton, concepts like paths and executions, as well as reachable states and guards on transitions.

Uploaded by

M.Talha Javed
Copyright
© © All Rights Reserved
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
729 views13 pages

11 Automata - Real Life Examples of Automata

The document discusses examples and definitions related to automata, which are machines that can transition between different states. It provides examples of automata like a digital watch, digicode lock, and modulo 3 counter to illustrate states, transitions, and executions. Formal definitions covered include the components of an automaton, concepts like paths and executions, as well as reachable states and guards on transitions.

Uploaded by

M.Talha Javed
Copyright
© © All Rights Reserved
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/ 13

Automata

Real life examples of Automata


Outline
• Automata
• Examples
• Definitions
• Exercise
Models: Finite Automata
An automaton is a machine evolving from
one state to another under the action of
• transitions.
Digital watch automaton
– State: current hour and minutes
– 24 x 60 = 1440 possible states
– Transition: links any pair of states one minute
apart

0 …
0 0
1:30 1:31 1:32
Formal Definition: Automaton
• An automaton is a tuple A=Q, E, T,q0, l
– Q is a finite set of states;
– E is a finite set of transitions labels;
– T  Q  E  Q is the set of transitions;
– q0 is the initial state ;
– l is the mapping which associates with each state
of Q the finite set of elementary properties which
hold in that state.
Digicode automaton
Q ={1, 2, 3, 4}
E ={A, B, C};
T ={(1, A, 2), (1, B, 1), (1,C, 1), (2, A, 2), (2, B, 3), (2, C,
1), (3,A,4), (3, B, 1),
(3, C, 1)}
q0=1
Digicode automaton
Q ={1, 2, 3, 4}
E ={A, B, C};
T ={(1, A, 2), (1, B, 1), (1,C, 1), (2, A, 2), (2, B, 3), (2, C,
1), (3,A,4), (3, B, 1),
(3, C, 1)}
q0=1

1  Properties
2 
;

PA Px: an x has just been keyed in
l  3  P , pred predn : The preceding state in an execution is n.
 ; B 2

4;  P , pred
A 3

;
Modulo 3 Counter Automaton

– Q ={0, 1, 2}
– E ={inc, dec}
– T ={(0, inc, 1), (0, dec, 2), (1,inc, 2), (1, dec, 0), (2, inc, 0), (2, dec,
1)}
– q0=0
Definitions
• Path: A sequence , finite or infinite, of transitions
which follow each other

 : 3 B1A2 A2
– Length of a path: |  |= Number of transitions
• Eg. |  |=3
– (i) : denotes the state reached after ith transition (i <= | 
| )
– Closed Path (Cycle)?
Definitions

• Execution: path starting from an initial


state

 :1A2 B3 A4


– Partial execution (which can be extended)
 :1A2 B3
– Complete execution (which cannot be
extended)
 :1A2 B3 A4
Execution Tree
• Execution tree organizes the set of execution in the form of
tree
Definitions
• Reachable State: A state is reachable if it
appears in an execution

Digicode Automaton
Digicode

-
– All states are reachable in the above
automaton
Definitions
• A guard is a constraint on a transition.
 It allows the firing of a transition when it is
satisfied

Digicode Automaton with guarded


Exercise: Printer Manager
• A printer shared by two users A and B:
• “req” action is a print request
• “beg” action is the start of print job requested by a
user

• Specify the automaton of print

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy