ASSIGNMENT OF AUTOMATA FOR COMPUTER SCIENCE

Finite Automaton can be classified into two type :-

 Deterministic Finite Automaton (DFA)

 Non-deterministic Finite Automaton (NFA)

Deterministic Finite Automaton (DFA)

In DFA, for each input symbol, one can determine the state to which the machine will move.
Hence , it is called Deterministic Finite Automaton. As it has a finite number of state , the
machine is called Deterministic Finite Machine or Deterministic Finite Automaton.
 In NFA can be represented by 5 tuple :-

 Q is a finite of state.
 Ʃ is a finite set of symbols called the alphabet.
 Ᵹ is the transition function where Ʃ x Q → Q.
 q0 Is the initial state from where any input is processed (q0 ɛ Q).
 F is a set of final state/states of Q(F Q).

Non-deterministic Finite Automaton

In NFA, for a particular input symbol ,the machine can move to any combination of the
states in the machine. In odher word , the exact state to which the machine moves cannot
be determined. Hence, it is Non-deterministic finite automaton.
As it is has finites number of states, the machine is called Non-deterministic Finite
Automaton.
 In NFA can be represented by 5 tuple :-

 Q is a finite of state.
 Ʃ is a finite set of symbols called the alphabet.
 Ᵹ is the transition function where Ʃ x Q →2 Q.
 q0 Is the initial state from where any input is processed (q0 ɛ Q).
 F is a set of final state/states of Q(F Q).

T he following procedure converts rule steps:-

 Step 1: Create state table from the given NFA

 Step 2: Ca blank state table under possible input alphabets for the equivalent DFA
 Step 3: Mark the start state of the DFA by q0 (same as the NFA)
 Step 4: Find out the combination of states { Q0 , Q1, …,Qn } for each possible input alphabet.
 Step 5: Each time we generate a new DFA state under the input alphabet columns, we have to
apply step 4 again, otherwise go to step 6.
 Step6: The states which contain any of states of the NFA are the final states of the equavalent
DFA.
For exampe

1
C 0 B

0
0 1
E
0,1

A
0,1 0
0
D

This diagram is NFA

NFA Converts to DFA the above example

Step1 create table NFA and step 2 create blank….

q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}
b {c} {e}
c Φ {b}
d {e} Φ
e Φ Φ

Step3, step4 ,step5

q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}

q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}
{a,b,c,d,e} {a,b,c,d,e} {b,d,e}
q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}
{a,b,c,d,e} {a,b,c,d,e} {b,d,e}
{d,e} E D

q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}
{a,b,c,d,e} {a,b,c,d,e} {b,d,e}
{d,e} E D
{b,d,e} {c,e} E

q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}
{a,b,c,d,e} {a,b,c,d,e} {b,d,e}
{d,e} E D
{b,d,e} {c,e} E
e Φ Φ

q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}
{a,b,c,d,e} {a,b,c,d,e} {b,d,e}
{d,e} E D
{b,d,e} {c,e} E
e Φ Φ
d E Φ

q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}
{a,b,c,d,e} {a,b,c,d,e} {b,d,e}
{d,e} E D
{b,d,e} {c,e} E
e Φ Φ
d E Φ
{c,e} Φ B

q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}
{a,b,c,d,e} {a,b,c,d,e} {b,d,e}
{d,e} E D
{b,d,e} {c,e} E
e Φ Φ
d E Φ
{c,e} Φ B
b C E
This table DFA
q Ᵹ(q,0) Ᵹ(q,1)
a {a,b,c,d,e} {d,e}
{a,b,c,d,e} {a,b,c,d,e} {b,d,e}
{d,e} E D
{b,d,e} {c,e} E
e Φ Φ
d E Φ
{c,e} Φ B
b C E
c Φ B

THE Diagram of DFA

1 {b,d,e
{a,b,c,d,e}

0 1 {c,e}

{d,e} 1

1 1
{c}
{a} {b} 0

0
1 1

{e}
0
{d}

NAME :DEBERE KUMELA

ID NO : UGR/68972/14
SECTION: 1
COURSE: AUTOMATON THEORY