# DFA

View

### DATE: October, 2014

### TECHNOLOGIES

Deterministic Finite Automata (DFA) application to test validity of inputs against an alphabet and transition function.

A **Deterministic Finite Automata (DFA)** is defined as a *5-tuple*
, where:

- : is a finite set of states
- : is an alphabet
- : is an
*initial state* - : is a set of accepted states
- : is a
*transition function*which determines how to jump from one state to another.