Transition System

Transition system: - A transition graph system is a finite directed labeled
graph in which each vertex or node represents a state and the directed edge
indicate the transition of a state and edge are labeled with input/output.
A typical transition system shown below.
In above figure, the initial state is represented by a circle with an arrow pointing
towards it, the final state by two concentric circles, and the other state are
represented by just a circle. The edges are labeled by input/output (e.g. by 1/0 or
1/1). For example, if the system is in state q0 to q1 with label 1/0. It outputs 0.
Analytical definition of a transition system
Definition:- A transition system is a 5-tuple (Q,∑,δ,Q0 , F),where

(a) Q, ∑ and F are the finite nonempty set of state, the input alphabet, and the set
of final state, respectively, as in the case of finite automata;
(b)Q0 Q , and Q0 is nonempty;
(c) δ is a finite subset of Q ∑* Q. in other words, if (q1,w,q2) is in δ, it means the

following: The graph starts at the vertex q1,goes along a set of edges, and reaches
the vertex q2. The concatenation of the label of all the edges thus encountered is
w.
Example:- consider the transition system given in following figure.
Determine the initial states, final states, and the acceptability of 101011,111010
Solution:- The initial states are q0 and q1. There is only one final state, viz., q3.
The path value of q0 q0 q2 q3 is 101011. As q3 is the final states, 101011is accepted

by the transition system. But, 101011 is not accepted by the transition system as
there is no path with path value111010.
Properties of transition functions:-

Property 1:- δ (q, aw) =q in a finite automation. This means the state of the
system can be changed only by an input symbol.
Property 2:- For all strings w and input symbols a,

δ (q ,aw) = δ(δ(q ,a),w)
δ (q ,wa) = δ(δ(q ,w),a)
this property gives state after the automation consume or reads the first symbol
of a string ‘aw’ and the state after the automation consumes a prefix of the
strings ‘wa’.
Non deterministic finite state machine:- A nondeterministic finite
automation(NDFA) is a 5-tuple(Q ,∑ ,δ ,q0 ,F) where
1. Q is a finite nonempty set of status;
2. ∑ is a finite nonempty set of inputs;
3. δ is the transition function mapping from Q ∑ into 2Q which is the power

set of Q, the set of all subsets of Q;
4. q0 є Q is the initial state;
5. F Q is the set of final states.
The equivalence of DFA and NDFA:-
• A DFA can simulate the behavior of NDFA by increasing the number of

state.
In other words , a DFA (Q,∑,δ,q0,F) can be viewed as an NDFA

(Q,∑,δ’,q0,F) by defining δ’ (q,a) = { δ(q,a}.)
• Any NDFA is a more general machine without being more powerful.
Theorem:- for every NDFA, there exists a DFA which simulates the behavior of
NDFA. alternatively, if L is the set accepted by NDFA, then there exists a DFA
which also accepts L.
Mealy and Moore models:-

Definition of Moore machine:- The Moore machine is a six- tuple (Q,∑,∆,δ,λ,q0),
where
• Q is a finite set of states;
• ∑ is the input alphabet;
• ∆ is the output alphabet;

• δ is the transition function ∑ Q into Q;
• λ is the output function mapping Q into ∆;
• q0 is the initial state.
Definition of Mealy machine:- A Mealy machine is a six tuple (Q,∑,∆,δ,λ,q0),

where symbol except λ have the same meaning as in the Moore machine. λ is the
output function mapping ∑ Q into ∆.
Example:-
The following gives a Moore machine. The initial state q0 is marked

with an arrow. The table defines δ and λ.
Present state next state δ output
a= 0 a=0 λ
q0 q3 q1 0
q1 q1 q2 1
q2 q2 q3 0
q3 q3 q0 0
For the input string 0111,the transaction of states is gives by q0 q3 q0 q1 q2.
The output strings is 00010. For the input string Λ, the output is λ(q0) =0.
The following table describes a mealy machine.

Next state
Present a= 0 a=1
State state output state output
q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0
Procedure for transforming a Mealy machine into a Moore machine :-

WE devlop procedure for transforming a Moore machine and vice versa so that
for a given input string the output strings are the same inboth the machines.
Procedure for transforming a Moore machine to corresponding Mealy

machine :- We modify the acceptability of input string by a moore machine by
neglecting the response of the Moore machine to input Λ. We thus define that
Mealy machine M and Moore machine M’ are equivalent if for all input strings
w,bZm(w) = Zm(w),where b is the output of Moore machine for it’s initial state.
Then result: Let M1 =(Q,∑,∆,δ,λ,q0) be a Moore machine. Then the following
procedure may be adopted to construct an equivalent mealy machine M2.
Construction:-
a) We have to define the output function function λ’ for Mealy machine as a

function of present state and input symbol. We define λ by
λ’(q,a) = λ(δ(q,a)) for all states q and input symbols a.
b) The transition function is the same as that of the given Moore function.
Minimisation of finite automata:- We construct an automata with
minimum number of states equivalent to a given automata M.
Definition:- Two states q1 and q2 are equivalent if both δ(q1,x) and δ(q2,x)are
final state, or both of them are nonfinal states for all x є ∑*
We mention some of the properties of these relation.
Properties1: The relation we have defined, i.e. equivalent and k-equivalence,

are equivalence relation, i.e. they are reflexive, symmetric and transitive.
Property2: By theorem, these induce partition of Q. These partitions can be

denoted by π and πk, respectively. Element of πk are k-equivalence classes.
Property3: if q1 and q2 are k-equivalent for all k≥0,then they are equivalent.
Property4: if q1 and q2 are (k+1)-equivalent, then they are k-equivalent.
Property5: πn = πn+1 for some n.
Construction of minimunm automaton:-

Step1: By definition of 0-equivalence, π0 = {Q10,Q20},where Q10 is the set of all
final states and Q20 = Q – Q10.
Step2: let Qik be any subset in πk. if q1 and q2 are in Qik, they are (k+1)-
equivalent provided δ(q2, a) are k-equivalent. Find out whether δ(q2, a) and
δ(q2, a) are in the same equivalence class in πk for every a є ∑ . if so, q1 and q2
are (k+1)-equivalent . in this way, Qik is further divided into (k+1)-aquivalent
classes. Repeat this for every Qik in πk to get all the element of πk+1.
Step3: construct πn for n =1,2,…..untill πn = πkn+1 .
Step4: For the requied minimum states automayion, the states the states are
the equivalence classes obtained in step 3, i.e. the elements of πn.The states
tabel is obtained by replacing a state q by the conrresponding equivale [q].

Transition System

Uploaded by

Copyright:

Available Formats

Transition System

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Transition System

Uploaded by

Copyright:

Available Formats

Transition system: - A transition graph system is a finite directed labeled

A typical transition system shown below.

Analytical definition of a transition system

Definition:- A transition system is a 5-tuple (Q,∑,δ,Q0 , F),where

(b)Q0 Q , and Q0 is nonempty;

(c) δ is a finite subset of Q ∑* Q. in other words, if (q1,w,q2) is in δ, it means the

The path value of q0 q0 q2 q3 is 101011. As q3 is the final states, 101011is accepted

Properties of transition functions:-

Property 2:- For all strings w and input symbols a,

δ (q ,wa) = δ(δ(q ,w),a)

1. Q is a finite nonempty set of status;

2. ∑ is a finite nonempty set of inputs;

3. δ is the transition function mapping from Q ∑ into 2Q which is the power

4. q0 є Q is the initial state;

5. F Q is the set of final states.

The equivalence of DFA and NDFA:-

• A DFA can simulate the behavior of NDFA by increasing the number of

In other words , a DFA (Q,∑,δ,q0,F) can be viewed as an NDFA

• Any NDFA is a more general machine without being more powerful.

Mealy and Moore models:-

• Q is a finite set of states;

• ∑ is the input alphabet;

• ∆ is the output alphabet;

• λ is the output function mapping Q into ∆;

• q0 is the initial state.

Definition of Mealy machine:- A Mealy machine is a six tuple (Q,∑,∆,δ,λ,q0),

The following gives a Moore machine. The initial state q0 is marked

Present state next state δ output

For the input string 0111,the transaction of states is gives by q0 q3 q0 q1 q2.

The following table describes a mealy machine.

State state output state output

Procedure for transforming a Mealy machine into a Moore machine :-

Procedure for transforming a Moore machine to corresponding Mealy

a) We have to define the output function function λ’ for Mealy machine as a

λ’(q,a) = λ(δ(q,a)) for all states q and input symbols a.

We mention some of the properties of these relation.

Properties1: The relation we have defined, i.e. equivalent and k-equivalence,

Property2: By theorem, these induce partition of Q. These partitions can be

Property4: if q1 and q2 are (k+1)-equivalent, then they are k-equivalent.

Property5: πn = πn+1 for some n.

Construction of minimunm automaton:-

Step3: construct πn for n =1,2,…..untill πn = πkn+1 .

You might also like