Similar to Pfsm, Dfsm implements a markov chain. Each state has a number of next states out of which one is randomly chosen.
array in the format:
Each item can be a number, or a ugen, typically demand rate. If no end item is given, 0.0 is used as default.
number of items from each state to embed. If inf, they are embedded completely.
demand rate random number generator that should ouput values between 0.0 and 1.0. If a deterministic ugen is used, the choice of next states of the finite state machine can be controlled (i.e. 0 will allways choose the first, 1 always the last, else in between).