Everything About ___
Live briefing

Everything about Deterministic finite automaton

Finite-state machine

In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA) is a finite-state machine that accepts or rejects a given string of symbols, by running through a state sequence uniquely determined by the string. Deterministic refers to the uniqueness of the computation run. It is also known as a deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state automaton (DFSA). 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. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Deterministic finite automatonA 5-minute orientation
  2. Pick up a classic book: Understanding Computers Today and TomorrowThe most-reprinted book on the subject
  3. Go sideways: Nondeterministic finite automatonA closely related topic
  4. Go sideways: Alternating finite automatonA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Formal definition
  2. Example
  3. Variations
  4. Closure properties
  5. As a transition monoid
  6. Advantages and disadvantages
  7. DFA identification from labeled words
  8. Equivalent models

🏆 Landmark papers (most cited)

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics