FSA

2.2.1 Using an FSA to Recognize Sheeptalk
2.2.2 Formal Languages
2.2.3 Another Example ...

Equilibrium Ergodic Euclidean Euler's Method Evolution Evolutionary Stable Strategy (ESS) Excitatory Experimentation Expert System F Feedback Feedback Neural Network Feedforward Neural Network Feigenbaum Constant Finite-State Automaton (FSA) Fish ...

In the theory of computation, a finite state machine (FSM) or finite state automaton (FSA) is an abstract machine that has only a finite, constant amount of memory. The internal states of the machine carry no further structure.

Finite State Machines (FSM), also known as Finite State Automation (FSA), at their simplest, are models of the behaviors of a system or a complex object, with a limited number of defined conditions or modes, ...

The vast majority of the technologies available on the market, such as planning algorithms, finite state machines (FSA), or expert systems, are based on the traditional or symbolic AI approach. Its main characteristics are: ...

See also: Agent, Neural network, Complexity, Artificial intelligence, Complex system