logo

Video encyclopedia

Deterministic finite automaton

0:34

Simple deterministic finite automaton

0:34

Simple deterministic finite automaton

1:53

A simple deterministic finite automata.

1:33

What is Deterministic finite automata?

3:49

Simulation of Deterministic Finite Automaton

In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite state machine (DFSM), or deterministic finite state automaton (DFSA)—is a finite-state machine that accepts or rejects strings of symbols and only produces a unique computation of the automaton for each input string. Deterministic refers to the uniqueness of the computation. In search of the simplest models to capture finite-state machines, Warren McCulloch and Walter Pitts were among the first researchers to introduce a concept similar to finite automata in 1943.
  • Formal definition 

  • Complete and incomplete 

  • Example 

  • Closure properties 

  • As a transition monoid 

  • Local automata 

  • Random 

  • Advantages and disadvantages 

  • DFA identification from labeled words