Deterministic Finite Automaton

A Finite State Automata that has a definite result.

• Subset of NFA Given input String $x$, it can accept or reject $x$.

Formal Definition

A DFSA $M$ is a quintuple $M=(Q,\Sigma ,\delta ,s,F)$ where:

• $Q$ is a finite set of States
• $\Sigma$ is a finite Alphabet
• $\delta :Q\times \Sigma \to Q$ is the Transition Function
• $s\in Q$ is the start or initial State
• $F\subset Q$ is the set of accepting states.

Concepts

• Extended Transition Function