=====discrete Keyword 3=====
finite state machine.

====Definition====
    It is conceived as an abstract machine that can be in one of a finite number of states. 
    The machine is in only one state at a time; the state it is in at any given time is called the current state.
    It can change from one state to another when initiated by a triggering event or condition, this is called a transition. 

====References====
http://en.wikipedia.org/wiki/Finite-state_machine

=====discrete Keyword 3 Phase 2=====
Matrix Multiplication

====Definition====
The multiplication of two or more matrices to produce a new matrix.
====References====
http://en.wikipedia.org/wiki/Matrix_multiplication#Powers_of_matrices

  * Reference 1
  * Reference 2
  * Reference 3
====Demonstration====


Suppose
[[http://upload.wikimedia.org/math/9/4/4/9447513f3529a8ead62db16b82193913.png|MM1]]

using the inner product approach:
[[http://upload.wikimedia.org/math/e/e/f/eef4d042bc504d3c179196117abdaf3b.png|InnerMM]]

while the outer product approach gives:
[[http://upload.wikimedia.org/math/0/5/0/050601f68666d7f0bcbab99d32570146.png|OuterMM]]

Source Link:
http://en.wikipedia.org/wiki/Matrix_multiplication#Algorithms_for_efficient_matrix_multiplication