Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
14 views3 pages

Deterministic Finite Automaton

The document provides an overview of Deterministic Finite Automaton (DFA), a type of finite automaton where each input symbol leads to a specific state. It includes a formal definition of DFA represented by a 5-tuple and explains its graphical representation using state diagrams. An example is given to illustrate the transition function and states involved in a DFA.

Uploaded by

23b01a1253
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views3 pages

Deterministic Finite Automaton

The document provides an overview of Deterministic Finite Automaton (DFA), a type of finite automaton where each input symbol leads to a specific state. It includes a formal definition of DFA represented by a 5-tuple and explains its graphical representation using state diagrams. An example is given to illustrate the transition function and states involved in a DFA.

Uploaded by

23b01a1253
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

9/21/22, 10:56 PM Deterministic Finite Automaton

Deterministic Finite Automaton

Finite Automata

98 Lectures 10 hours

 Arnab Chakraborty

More Detail

Theory Of Computation - Finite Automata | Automata Theory In Hindi

15 Lectures 2 hours

 Anchal Kamra

More Detail

State Machines And Automata: Building A RegExp Machine

https://www.tutorialspoint.com/automata_theory/deterministic_finite_automaton.htm 1/3
9/21/22, 10:56 PM Deterministic Finite Automaton

16 Lectures 1.5 hours

 Packt Publishing

More Detail

Finite Automaton can be classified into two types −

Deterministic Finite Automaton (DFA)


Non-deterministic Finite Automaton (NDFA / 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 Automaton. As it has a finite number of states, the machine is called
Deterministic Finite Machine or Deterministic Finite Automaton.

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

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},

https://www.tutorialspoint.com/automata_theory/deterministic_finite_automaton.htm 2/3
9/21/22, 10:56 PM Deterministic Finite Automaton

q0 = {a},
F = {c}, and

Transition function δ as shown by the following table −

Present State Next State for Input 0 Next State for Input 1

a a b

b c a

c b c

Its graphical representation would be as follows −

https://www.tutorialspoint.com/automata_theory/deterministic_finite_automaton.htm 3/3

You might also like