Why not have events call the right callback on state directly? public enum State { abstract State processFoo(); abstract State processBar(); State processBat() { return this; } // A default implementation, so that states that do not use this event do not have to implement it anyway. … State1 { State processFoo() { return State2; … Read more
The heart of a state machine is the transition table, which takes a state and a symbol (what you’re calling an event) to a new state. That’s just a two-index array of states. For sanity and type safety, declare the states and symbols as enumerations. I always add a “length” member in some way (language-specific) … Read more
I don’t really get the question. The State Design pattern is pretty clear. See the Design Patterns book. class SuperState( object ): def someStatefulMethod( self ): raise NotImplementedError() def transitionRule( self, input ): raise NotImplementedError() class SomeState( SuperState ): def someStatefulMethod( self ): actually do something() def transitionRule( self, input ): return NextState() That’s pretty … Read more
Markov chains can be represented by finite state machines. The idea is that a Markov chain describes a process in which the transition to a state at time t+1 depends only on the state at time t. The main thing to keep in mind is that the transitions in a Markov chain are probabilistic rather … Read more