|
The figure to the left depicts the same
finite state machine in three different ways. The top-left figure
depicts the machine as a set of quadruples and we refer to this
type of representation as the Quadruple or Rule Representation.
The figure on the top-right depicts the machine as a Markov State
Diagram. And, the figure on the bottom depicts the machine in
what is referred to a the State Table Representation.
This machine accepts
strings which begin with n a's and then continue with m b's
where n is greater than or equal to 0 and m is greater than 0.
Thus, the input vocabulary or set, Sigma, is {a,b}, the state
set or Q is {q0,q1,qhalt}, the start state is q0,
and the set of final states is {qhalt}. The Markov Diagram and the
State Table Representation both make explicit the mapping from
Q x Sigma to Q.
The language accepted
by this machine is: {b, ab, aab, abb, bbbb, aaaab, etc.}.
Below are links to
animations of this machine. Animation begins as the page is opened,
and they are set to loop continuously while the page is open.
|
