Scribd
Upload
4 views

03_Introduction to Finite Automata

The document introduces finite automata, a mathematical model used to process inputs through various states to produce outputs, particularly useful in programming tools like text editors and lexical analyzers. It defines finite automata as a 5-tuple structure and distinguishes between deterministic finite automata (DFA) and non-deterministic finite automata (NFA), highlighting their differences in state transitions and construction complexity. The document also explains the operational mechanics of both types of automata, emphasizing their unique characteristics and functionalities.

Uploaded by

gujjarluqman814
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

03_Introduction to Finite Automata

The document introduces finite automata, a mathematical model used to process inputs through various states to produce outputs, particularly useful in programming tools like text editors and lexical analyzers. It defines finite automata as a 5-tuple structure and distinguishes between deterministic finite automata (DFA) and non-deterministic finite automata (NFA), highlighting their differences in state transitions and construction complexity. The document also explains the operational mechanics of both types of automata, emphasizing their unique characteristics and functionalities.

Uploaded by

gujjarluqman814
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

INTRODUCTION

TO
FINITE AUTOMATA
Finite State Machine/ Automata/ Automaton
• The finite state machine represents a mathematical model of a system
with certain input.
• The input is processed by various states.
• The model finally gives certain output.
• The finite state system is very good design tool for the programs such
as TEXT EDITORS and LEXICAL ANALYZERS.
Definition of Finite Automata

• A finite automata is a collection of 5-tuple(Q,,,q0,F) (which is also


known as Formal Description)Where ,
Q is finite set of states, which is non empty.
 is input alphabet, indicates input set.
 is transition function or mapping function. We can determine
the next state using this function.
q0 is an initial state and is in Q
F is set of final states.
Finite Automata Model
• The finite automata can be represented as follows:
Input Tape
A B A B A B A B A B

Tape
Reader
Input Tape: It is a linear tape
having some number of cells. Each
input symbol is placed in each cell.
Out put
Finite
Control
Finite Control: The finite control
decides the next state on receiving
particular input from input tape.
Types of Automata

Finite Automata

Deterministic Non Deterministic


Finite Automata Finite Automata
Types of Automata
• Deterministic Finite Automata: The Finite Automata is called
Deterministic Finite Automata if there is only one path for a specific
input from current state to next state.
It can be represented as follows:
• A machine M = (Q,,,q0,F) Where ,
Q is finite set of states, which is non empty.
 is input alphabet, indicates input set.
 is transition function or mapping function. We can determine
the next state using this function.
q0 is an initial state and is in Q
F is set of final states.
Where :Q X  -> Q
Types of Automata
• Non Deterministic Finite Automata: The Finite Automata is called
Non Deterministic Finite Automata if there are more than one path
for a specific input from current state to next state.
It can be represented as follows:
• A machine M = (Q,,,q0,F) Where ,
Q is finite set of states, which is non empty.
 is input alphabet, indicates input set.
 is transition function or mapping function. We can determine
the next state using this function.
q0 is an initial state and is in Q
F is set of final states.
Where :Q X  -> 2Q
Difference between DFA & NFA

Deterministic Finite Automata Non Deterministic Finite Automata


For Every symbol of the alphabet, there is only one We do not need to specify how does the NFA react
state transition in DFA. according to some symbol.

DFA cannot use Empty String transition. NFA can use Empty String transition.

DFA can be understood as one machine. NFA can be understood as multiple little machines
computing at the same time.
DFA will reject the string if it end at other than If all of the branches of NFA dies or rejects the string,
accepting state. we can say that NFA reject the string.
Backtracking is allowed in DFA. Backtracking is not always allowed in NFA.

DFA is more difficult to construct. NFA is easier to construct.

You might also like