finite state machine

(redirected from Finite state automaton)
Also found in: Acronyms, Encyclopedia.
Related to Finite state automaton: Automata theory

finite state machine

n.
A model of a computational system, consisting of a set of states, a set of possible inputs, and a rule to map each state to another state, or to itself, for any of the possible inputs. The computational core of a Turing machine is a finite state machine. Also called finite state automaton.
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.
References in periodicals archive ?
In particular, an RMECA of level 0 has no clock, it is a plain finite state automaton. An event-recording clock and an event-predicting clock can be associated with each monitored automaton.
A critical difficulty in checking the language containment, L([M.sub.1]) [subset or equal to] L([M.sub.2]), is the construction of a complement finite state automaton [M.sup.c.sub.2] of [M.sub.2].
Full browser ?