 ##  [Finite Automaton](/index.php/finite-automaton) 

  ##  [Finite Automaton](https://natural.quantumdictionary.io/finite-automaton-0) 

  
 [![Natural & Formal Sciences Dictionary](/sites/default/files/styles/large/public/2026-01/Natural%20%26%20Formal%20Sciences.png.webp?itok=2kCDRVQv)](/index.php/topic-specific-dictionaries/natural-formal-sciences)


**Natural &amp; Formal Sciences Dictionary**

 
Definition

A mathematical model of computation consisting of a finite set of states, an input alphabet, transition relations, a start state, and one or more accepting states; used to recognize regular languages. Variants include deterministic finite automata (DFA) and nondeterministic finite automata (NFA).