1
It is mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. It can change from one state to another, by means of a transition, in response to some external inputs.
2
An action that must be executed just after another. One step at a time.
3
A finite state machine characterized by the association of output symbols with transitions between states.
4
a directed graph in which each node corresponds to a state of the machine and each directed arc indicates a possible transition from one state to another.
5
The conditions placed prior instant 0.
6
Not subject to uncertainty
7
Bounded in magnitude, spatial or temporal extent
8
Is a tabular representation of the two functions used in a finite state machine. It uses one row for each state and one column for each input symbol.
9
A resulting sequence of output symbols from the machine.
10
A sequence of input symbols presented to the machine.
11
Internal conditions of the machine
