* an explanation how to test the multiple heterogenous out-transitions of a state efficiently,
* the reason for the silent assumption that at most one out-transition of a state is followed, i.e. that this is not an NFA [0],
* most importantly, a comparison with Binary Decision Diagrams [1].
[0] https://en.wikipedia.org/wiki/Nondeterministic_finite_automa...
[1] https://en.wikipedia.org/wiki/Binary_decision_diagram
* an explanation how to test the multiple heterogenous out-transitions of a state efficiently,
* the reason for the silent assumption that at most one out-transition of a state is followed, i.e. that this is not an NFA [0],
* most importantly, a comparison with Binary Decision Diagrams [1].
[0] https://en.wikipedia.org/wiki/Nondeterministic_finite_automa...
[1] https://en.wikipedia.org/wiki/Binary_decision_diagram