- A mathematical model of an entity that describes its behavior as a result of its past history and current inputs.
- Finite state machines (FSM’s) are machines (generally computer programs) which proceed in clearly separate and discrete steps from one to another of a finite number of configurations or states.
- a machine with a fixed number of states and no memory, eg the processor in a Turing Machine; used as a theoretical basis for creating efficient algorithms for, eg, communication protocols, lexical analysis and pattern matching.
- A finite state machine (FSM) or finite state automaton (plural: automata) is a model of behavior composed of a finite number of states, transitions between those states, and actions.

Advertisements
(function(g,$){if("undefined"!=typeof g.__ATA){
g.__ATA.initAd({sectionId:26942, width:300, height:250});
g.__ATA.initAd({sectionId:114160, width:300, height:250});
}})(window,jQuery);
var o = document.getElementById('crt-52075186');
if ("undefined"!=typeof Criteo) {
var p = o.parentNode;
p.style.setProperty('display', 'inline-block', 'important');
o.style.setProperty('display', 'block', 'important');
Criteo.DisplayAcceptableAdIfAdblocked({zoneid:388248,containerid:"crt-52075186",collapseContainerIfNotAdblocked:true,"callifnotadblocked": function () {var o = document.getElementById('crt-52075186'); o.style.setProperty('display','none','important');o.style.setProperty('visbility','hidden','important'); }
});
} else {
o.style.setProperty('display', 'none', 'important');
o.style.setProperty('visibility', 'hidden', 'important');
}