A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of...

A virtual finite-state machine (VFSM) is a finite-state machine (FSM) defined in a virtual environment. The VFSM concept provides a software specification...

deterministic finite automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state automaton...

A finite-state transducer (FST) is a finite-state machine with two memory tapes, following the terminology for Turing machines: an input tape and an output...

theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source state and input...

UML state machine, formerly known as UML statechart, is an extension of the mathematical concept of a finite automaton in computer science applications...

In computer science, a communicating finite-state machine is a finite-state machine labeled with "receive" and "send" operations over some alphabet of...

nondeterministic finite automaton (GNFA), also known as an expression automaton or a generalized nondeterministic finite state machine, is a variation...

logic, a state-transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite-state machine will move...

v t e In computation, a finite-state machine (FSM) is event driven if the transition from one state to another is triggered by an event or a message....

theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. This...

machine. It has a "head" that, at any point in the machine's operation, is positioned over one of these cells, and a "state" selected from a finite set...

Turing machine Also similar to the finite state machine, except that the input is provided on an execution "tape", which the Turing machine can read...

substantial power savings. A finite-state machine with data path (FSMD) is a mathematical abstraction which combines a finite-state machine, which controls the...

objects through the system". State diagrams can be used to graphically represent finite-state machines (also called finite automata). This was introduced...

In computer science, a channel system is a finite-state machine similar to communicating finite-state machine in which there is a single system communicating...

normal. In other words, if one runs a finite-state machine on a normal sequence, where each of the finite-state machine's states are labeled either "output"...

In a conventional finite-state machine, the transition is associated with a set of input Boolean conditions and a set of output Boolean functions. In an...

finite number of states is called a finite automaton (FA) or finite-state machine (FSM). The figure on the right illustrates a finite-state machine,...

Moore machine is a finite-state machine whose current output values are determined only by its current state. This is in contrast to a Mealy machine, whose...

distinct states. The concept of state is formalized in an abstract mathematical model of computation called a finite-state machine, used to design both sequential...

size. Like the counter machine, the RA-machine contains the execution instructions in the finite-state portion of the machine (the so-called Harvard architecture)...

again allowing new data to be read. A process can be modeled as a finite state machine that is in one of two states: Active; the process computes or writes...

instructions are in the finite state machine in the manner of the Harvard architecture. Pointer machine – a blend of the counter machine and RAM models with...

In quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision process...

in which the program or part of it is thought of as a model of a finite-state machine (FSM) or any other (often more complicated) formal automaton (see...

In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal...

An aperiodic finite-state automaton (also called a counter-free automaton) is a finite-state automaton whose transition monoid is aperiodic. A regular...

weighted finite-state machine is a generalization of a finite-state machine in which the edges have weights, for example real numbers or integers. Finite-state...

In computer science, a deterministic acyclic finite state automaton (DAFSA), is a data structure that represents a set of strings, and allows for a query...