Scribd
Upload
29 views1 page

Dfa

A DFA is a deterministic finite automaton where the next state is determined by the current state and input symbol. It is represented as a 5-tuple of states, input symbols, transition function, initial state, and final states.

Uploaded by

Sano Khan
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
29 views1 page

Dfa

A DFA is a deterministic finite automaton where the next state is determined by the current state and input symbol. It is represented as a 5-tuple of states, input symbols, transition function, initial state, and final states.

Uploaded by

Sano Khan
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/ 1

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

Example

Let a deterministic finite automaton be

Q = {a, b, c},

= {0, 1},

q0 = {a},

F = {c}, and

You might also like