DFSA

DFSA or Deterministic Finite State Automaton is  a way to tell machine to react with particular input. Coming up an DFSA is quite easy but at the same time it can be challenging if more than one requirement is need to be fulfilled. Hence, there is certain tactics that we can use to create a DFSA.

First of all, if there is more than one condition need to be fulfilled, then create different DFSA for each condition, then try to combine both of the DFSA to come out with new DFSA which will match both requirement.

In order to prove the DFSA, we need to first generate a transition function for the diagram that we build. Then from that transition function we can come out with a extended transition matrix, which will describe each state of DFSA. This is a good way to know whether our DFSA will work for all inputs and outputs.