A S S I G N M E N T

Submitted By: Naveed Anjum Javaid

CMS ID: 24241
Submitted To: Mr. Raja Asif
Topic: Application of DFA

Deterministic Finite Automata

DFA is a finite state machine that accepts/rejects finite strings of symbols and only produces a
unique computation (or run) of the automaton for each input string.
'Deterministic' refers to the uniqueness of the computation. In search of simplest models to capture
the finite state machines, McCulloch and Pitts were among the first researchers to introduce a
concept similar to finite automaton in 1943.

Formally, a deterministic finite automaton is a 5-tuple(Q, ∑, δ,q0, F)

1. Q is a finite set called the states
2. ∑ is ia finite set called the alphabet
3. δ : Q X∑→ Q is the transition function.
4. q0∈ Q is the Start State
5. F ⊆ Q is the Set of accept States

Applications of Deterministic Finite Automata (DFA)

There are many applications of Deterministic Finite Automata (DFA), Some of them are listed
below:

 Vending Machines
 Traffic Lights
 Video Games
 Text Parsing
 Regular Expression Matching
 CPU Controllers
 Protocol Analysis
 Natural Language Processing
 Speech Recognition
Some of the applications are described as under:
Vending Machine
A vending machine is a machine which dispenses items such as snacks, beverages, alcohol,
cigarettes, lottery tickets, cologne, consumer products and even gold and gems to customers
automatically, after the customer inserts currency or credit into the machine.
Traffic Lights
Traffic lights, also known as traffic signals, traffic lamps, signal lights, robots in South Africa and,
in the past, semaphores, are signaling devices positioned at road intersections, pedestrian
crossings and other locations to control competing flows of traffic. Traffic lights were first
installed in 1868 in London and are now used all over the world.
Video Games
Finite state machines lend themselves to representing the behavior of computer- controller
characters in video games. The states of the machine correspond to the character's behaviors,
which change according to various events. These changes are modeled by transitions in the
state diagram. State machines are certainly not the most sophisticated means of implementing
artificially intelligent agents in games, but many games include characters with simple, state-
based behaviors that are easily and effectively modeled using state machines. Pac-Man is the
example of vid3eo games.
Text Parsing
A text parser takes typed input (a command) from the player and simplifies it to something the
game can understand. Usually, words with the same meaning are turned into the same word
(e.g. "take" and "get") and certain filler words are dropped (e.g. articles, or the "at" in "look at
rock").