CLASS 9 : DFA DETERMINISTIC FINITE AUTOMATA

That finite automata which does not contain any ambiguity is called DFA (Deterministic Finite Automata).

Condition for Deterministic Finite Automata : 

1. It must have one state, one input and we get one state as output.
2. Every state have a path for every input symbol that means every state have a unique path.

Example: 

Solution :

Q = { q0 , q1 , q2 }

Σ = { 0, 1 }

q0 = q0

F = { q2 }

Note: here φ is not a member of Q.

In the above transaction table every state have only one path. That means there is no ambiguity arise so we can say that it is a case of DFA.