Process input of an automaton (output differs from general case) construct_final_word_out() for inplace version Machine with final output constructed by implicitly reading trailing letters, cf. Transposition (all transitions are reversed) Output projection (old output is new input) Moments of the waiting time for first true outputĬartesian product of a transducer with another finite state machineĬomposition (output of other is input of self)Ĭomposition with other finite state machine
Main terms of expectation and variance of sums of labels with_final_word_out()Ĭhecks whether the colors of all states are equal Split transitions with input words of length > 1Ĭonstruct final output by implicitly reading trailing letters cf. Remove epsilon transitions (not implemented) Get a transition by its states and labelsįinal components (connected components which cannot be left again) Contents ¶ FiniteStateMachine and derived classes Transducer and Automaton ¶ Accessing parts of a finite state machine ¶ Which contain preconstructed and commonly used automata and transducers. (or the more general class FiniteStateMachine) This module adds support for finite state machines, automata andįor creating automata and transducers you can use classes Finite State Machines, Automata, Transducers ¶
0 kommentar(er)
