Dfsm:

Filter: Extension

demand rate finite state machine

Source: SymbolicMachines.sc

Similar to Pfsm, Dfsm implements a markov chain. Each state has a number of next states out of which one is randomly chosen.

rules |
array in the format: Each |

n |
number of items from each state to embed. If |

rgen |
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). |

helpfile source: /usr/local/share/SuperCollider/Extensions/SC3plugins/TagSystemUGens/HelpSource/Classes/Dfsm.schelp

link::Classes/Dfsm::

link::Classes/Dfsm::