Deterministic Finite Automaton (DFA)

 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 Automaton. 

As it has a finite number of states, the machine is called Deterministic Finite Machine or Deterministic Finite Automaton.

Definition of a DFA:

A DFA can be represented by a 5-tuple (Q, ∑, δ, q0, F) where −

Q is a finite set of states.

∑ is a finite set of symbols called the alphabet.

δ is the transition function where δ: 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).

Graphical Representation of a DFA:

A DFA is represented by digraphs called state diagram or Transition Diagram.

The vertices represent the states.

The arcs labeled with an input alphabet show the transitions.

The initial state is denoted by an empty single incoming arc.

The final state is indicated by double circles.

Example:

Let a deterministic finite automaton be →

Q = {a, b, c},

∑ = {0, 1},

q0 = {a},

F = {c}, and

Transition function δ as shown by the following table −

Its graphical representation would be as follows 

Transition function δ as shown by the following table

Draw the Transition Graph for the given Transition Table:

Acceptance of the String by Finite automata:

Check the String 11010 is accepted by the FA or Not?

Check the String 1101001 is accepted by the FA or Not?

Introduction                                                                                                                     NDFA/NFA