Main menu

Media Coverage

<div class="small-4 columns">media 1</div>

<div class="small-4 columns">media 2</div>

<div class="small-4 columns">media 3</div>

Reach to Us

Deterministic Finite Automata

Deterministic Finite Automata (DFA)

In a deterministic finite-state automaton (DFA), each move has only one choice for the next state of the device, given the current state and the next input. After processing the entire input string, if you end up in a final state (sometimes called an accept state), then the input string is in the language accepted by the finite-state automaton.

Contributor's Info