- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# What is Deterministic Finite Automata (DFA)?

Deterministic means that on each input there is one and only one state to which the automata can have the transition from its current state. In deterministic finite automata, the head can move only in one direction to scan the input tape symbols. But in the case of two-way, finite automata on scanning an input symbol the head of the tape may move in right or left from its current position.

A deterministic finite automata is a set of 5 tuples and defined as

M=(Q,Σ,$\delta$,q_{0},F) where,

Q: A non-empty finite set of states present in the finite control (q

_{0},q_{1},q_{2}).$\sum$:A Non-empty finite set of input symbols.

$\delta$: It is a transition function that takes two arguments, a state, and an input symbol, it returns a single state represented by ∴ $\delta$:Q x $\sum$ →Q. Let q is the state and a be the input symbol passed to the transition function. $\delta$(q,a)=q. q is the output of the function, which may be the same or new state.

q

_{0}∈ Q is the initial state.F $\subseteq$ Q is the set of final states.

**Example** − Minimize the following DFA

**Solution:**

- Make a transition Table.

- π
_{0}= {{5}}, {1, 2, 3, 4}} - For input a, on {1, 2, 3, 4} of π
_{0}

- For input b, on {1, 2, 3, 4} of π
_{0}

∴ {1, 2, 3, 4} will be split into {1, 3} and {2, 4}

∴ π_{1}={{5},{1,3},{2,4}}

- For input symbol a on {1, 3} of π
_{1}

Similarly for input symbol a on {2, 4} of π_{1}

- For input symbol b on {1, 3} of π
_{1}

Similarly for input symbol b on {2, 4} of π_{1}

Subset in π_{1} i.e., {1, 3} & {2, 4} will not be splitted.

π_{final}= {{5}, {1, 3}, {2, 4}}

There will be 3 states of DFA.

{5}, {1, 3} and {2, 4}

Minimized DFA will be −

- Related Articles
- What is Non deterministic finite automata?
- What is Non-Deterministic Finite Automata (NFA)?
- Can we convert a non-deterministic finite automata into a deterministic finite Automata?
- Explain Deterministic Finite Automata in TOC.
- Explain Non-Deterministic Finite Automata in TOC.
- What is finite automata?
- Construct the minimum DFA for any given finite automata.
- What is Finite Automata in Compiler Design?
- What are different types of finite automata?
- Efficient Construction of Finite Automata
- What are the regular expressions to finite automata?
- Explain non-deterministic push down automata in TOC?
- What is the conversion of a regular expression to finite Automata (NFA)?
- Distinguish between Finite Automata and Turing Machine
- Explain if the CFG is recognized by Non-deterministic push down automata