finite state machine

(redirected from Finite automata)
Also found in: Encyclopedia.
Related to Finite automata: Regular expression

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.
References in periodicals archive ?
Five electrical engineering papers propose a conversion method between left linear grammar and right linear grammar via finite automata, measure vacuum levels in MEMS packaging, detect a magnetizing inrush current in single-phase traction transformers, control the angle of DC motor output, and estimate lithium battery state-of-charge.
Objective: Finite automata are fundamental objects in Computer Science, of great importance on one hand for theoretical aspects (formal language theory, decidability, complexity) and on the other for practical applications (parsing).
They showed that a promise version of emptiness problem is undecidable for one-way probabilistic finite automata.
Using SAX to code every document into events sequence as Xfilter system input, a Yfilter was proposed to combine all FSMs to a Non-deterministic Finite Automata (NFA) to enhance the time and space using performance of Xfilter (Altinel el al.
It is concluded that the procedure of double encryption of an image using the finite automata provides an improved and advanced system for image security.
The 11 lectures delivered during the July 2010 School introduce the modern theory of groups generated by finite automata, noncommutative calculus and operads, applications of noncommutative tori to number theory and physics, the construction of spectral triples, twisted bundles and twisted K-theory, and noncommuntative motives.
Actually we implemented our theoretical model of finite automata (more powerful than the one presented in Benenson et al.
The work proposes the use of finite automata method Mealy apparatus--in describing the logical processes within a microprocessor device control-ling an electromechanical system.
FINITE AUTOMATA MODEL DESIGNED TO IMPROVE PRODUCTIVITY IN THE PROCESSING OF YOGURT
Combining Finite Automata, Parallel Programs and SDL Using Petri Nets.
Subsequently, the bidirectional string matching algorithm was implemented by modifying the Build Non-Deterministic Finite Automata (Build_NFA) function, the Build Deterministic Finite Automata from Non-Deterministic Finite Automata (Convert_NFA_DFA) function, the Add Pattern to State Machine (acsmAddPattern) function, the Compile State Machine (acsmCompile) function, and the Search Text or Binary Data for Pattern matches (acsmSearch) function in the multi-pattern search engine of Snort.