finite state machine

(redirected from Finite state machines)
Also found in: Encyclopedia.
Related to Finite state machines: Finite state automaton

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 ?
N-structures applied to finite state machines. IAENG International Journal of Applied Mathematics, 43(3)(2013), 233-237.
A step-by-step method is proposed to translate the cause-effect tables in finite state machines, which are then submitted to formal verification in the UPPAAL model checking tool.
The RAM-based architectures do not serve as a novel tool for implementation of complicated FSM structures such as parallel hierarchical finite state machines (PHFSM) [12] or reversible FSM [13].
described an efficient parallel algorithm that uses manycore GPUs for automatically deriving UIOs from Finite State Machines [34].
Sangiovanni-Vincentelli, Synthesis of finite state machines: logic optimization, Springer Science & Business Media, 2012.
Many digital systems in a realistic world, such as digital circuits, computer programs, or internet protocols, can be described mathematically as finite state machines. A finite state machine can be depicted as a graph, in which nodes symbolize every possible system state, and arrows symbolize every possible state transitions (Chakrabarti et al, 2002).
There are great news these days: SageMath has now a module for finite state machines, automata, and transducers [17], which was written and is still improved by the three authors of this article.
Each monitor encodes an invariant which is a Boolean condition that must always be true and they can be used to represent both safety properties and bounded-liveness properties that can be reduced to (possibly non-deterministic) finite state machines.
SimBionic runs many hierarchical finite state machines in parallel to detect meaningful temporal patterns of events and state conditions that indicate threat behaviors and intentions.
The book presents a robot controller model based on finite state machines, which adapts the genotype-phenotype mapping at runtime.
At a low level, finite state machines are relatively simple and easy to understand, as shown above.
Full browser ?