Scribd
Upload
7 views8 pages

Deterministic Finite Automata

Deterministic Finite Automata (DFA) are computational models that process input strings one symbol at a time, ensuring a unique path from the current state to the next for each input. DFAs do not accept null moves and can have multiple final states, making them useful in lexical analysis within compilers. The document also provides a formula for DFA components and an example illustrating state transitions based on input symbols.

Uploaded by

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

Deterministic Finite Automata

Deterministic Finite Automata (DFA) are computational models that process input strings one symbol at a time, ensuring a unique path from the current state to the next for each input. DFAs do not accept null moves and can have multiple final states, making them useful in lexical analysis within compilers. The document also provides a formula for DFA components and an example illustrating state transitions based on input symbols.

Uploaded by

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

Deterministic

Finite Automata
Presented by
B.Sumalatha
DFA(Deterministic finite
automata)
• DFA refers to deterministic finite automata . Deterministic refers to
the uniqueness of the computation. The finite automata are called
deterministic finite automata if the machine is read an input string one
symbol at a time.
• In DFA , there is only one path for specific input from the current state
to the next state.
• DFA does not accept the null move, ie., the DFA cannot change state
without any input character.
• DFA can contain multiple final states, It is used in Lexical Analysis in
Compiler.
In the below diagram , we can see that from state q0
for input a, there is only one path which is going to
q1. Similarly , from q0, there is only one path for
input b going to q2.
Formula for DFA
1.Q: finite set of states
2.∑: finite set of the input symbol
3.q0: initial state
4.F: final state
5.δ: Transition function
δ: Q x ∑→Q
Example

1.Q = {q0, q1, q2}


2.∑ = {0, 1}
3.q0 = {q0}
4.F = {q2}
Solution:
Present State Next state for Input 0 Next State of Input 1

→q0 q0 q1

q1 q2 q1

*q2 q2 q2
THANK YOU

You might also like