finite automaton

This term is a technical specification used primarily in computer science, mathematics, and formal language theory. It describes a theoretical machine that processes strings of symbols to determine if they belong to a specific language, characterized by its lack of external memory beyond its current state.

In professional discourse, the term is often used interchangeably with "finite-state machine" (FSM). While "automaton" is the singular form, the term is strictly used within the context of computational theory and is not applied to physical robots or autonomous vehicles in a general sense.