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

Scribd
Upload
28 views2 pages

Finite Automaton Report Utf8

A Finite Automaton (FA) is a mathematical model used to recognize patterns in input data, consisting of states and transitions based on input symbols. There are two main types: Deterministic Finite Automaton (DFA) which has one transition per state and input symbol, and Nondeterministic Finite Automaton (NFA) which allows multiple transitions and ε-transitions. FA is applied in various fields such as lexical analysis, regular expression matching, and pattern recognition, but it has limitations in recognizing context-free languages and lacks memory.

Uploaded by

hjit62742
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
28 views2 pages

Finite Automaton Report Utf8

A Finite Automaton (FA) is a mathematical model used to recognize patterns in input data, consisting of states and transitions based on input symbols. There are two main types: Deterministic Finite Automaton (DFA) which has one transition per state and input symbol, and Nondeterministic Finite Automaton (NFA) which allows multiple transitions and ε-transitions. FA is applied in various fields such as lexical analysis, regular expression matching, and pattern recognition, but it has limitations in recognizing context-free languages and lacks memory.

Uploaded by

hjit62742
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/ 2

Finite Automaton Report

Introduction
A Finite Automaton (FA) is a mathematical model of computation used to recognize
patterns in input data. It consists of a finite number of states and transitions between
those states based on input symbols. FA is widely used in text search, lexical analysis,
and regular expression matching.

Types of Finite Automata


There are two main types of Finite Automata:
1. Deterministic Finite Automaton (DFA)
2. Nondeterministic Finite Automaton (NFA)

Additionally, there is an ε-NFA, a variation of NFA that allows transitions without


consuming input symbols.

Deterministic Finite Automaton (DFA)


A DFA is a finite automaton where for each state and input symbol, there is exactly one
transition to another state.

Formal Definition:
DFA = (Q, Σ, δ, q₀, F)
- Q: Finite set of states
- Σ: Finite set of input symbols (alphabet)
- δ: Transition function, δ: Q × Σ → Q
- q₀: Initial state (q₀ ∈ Q)
- F: Set of final (accepting) states (F ⊆ Q)

Nondeterministic Finite Automaton (NFA)


An NFA allows multiple possible transitions for a given state and input symbol, including
transitions without consuming an input symbol (ε-transitions).

Formal Definition:
NFA = (Q, Σ, δ, q₀, F)
- Q: Finite set of states
- Σ: Finite set of input symbols (alphabet)
- δ: Transition function, δ: Q × (Σ ∪ {ε}) → P(Q)
- q₀: Initial state (q₀ ∈ Q)
- F: Set of final (accepting) states (F ⊆ Q)

Differences Between DFA and NFA


| Feature | DFA | NFA |
|--------------------|------------------------------------------|------------------------------------------|
| Transitions | One transition per input symbol per state | Multiple transitions
possible |
| ε-Transitions | Not allowed | Allowed (ε-NFA) |
| Complexity | Simpler but may require more states | More flexible but can be
harder to construct |
| Equivalence | DFA and NFA are equivalent in power | Every NFA has an
equivalent DFA |

Applications of Finite Automata


1. Lexical Analysis in Compilers
2. Regular Expression Matching
3. Network Protocols
4. Control Systems (e.g., vending machines, traffic lights)
5. Pattern Recognition in AI and NLP

Limitations of Finite Automata


1. Cannot recognize context-free languages (e.g., balanced parentheses)
2. Lacks memory to store past inputs
3. Limited computational power, only recognizing regular languages

You might also like