DFSA V.S. NDFSA

There are two common forms of State-Machines, the first one is known as the deterministic Finite-State-Automaton, which involves only and only a single determined successor transition path between each 2 states. Moreover, a transition must be specified for each input value.

The second one is known as the non-deterministic Finite-State-Automaton, which involves other alternative ways of defining transition paths including, but not limited to, multiple successor paths, no input value for a transition (null-transitions).

NDFSA helps to build simpler transition graphs, in which any rule can be applied and states can have more than one successor transition and even multiple input values.

On the other hand, DFSA has a verbose and strict logic pattern, however, both provide equivalent values and conversion between both can be done easily, in the next chapter, we will discuss some good techniques to convert from a NDFSA to a DFSA; because DFSA is direct, verbose and strict and usually simple in its transitions, sometimes it's feasible.