Examples of MarkovModel

• statechum.analysis.learning.MarkovModel
  Describes a non-probabilistic Markov model, where for every path we know either that,

  • the path was never encountered or
  • the path was encountered and there is a specific set of elements of alphabet that followed it.

  The idea is to use the supplied Markov matrix to predict transitions from a specific state, passed as an argument. The choice of direction is not a choice between predicting transitions leaving a state based on those surrounding that state v.s predicting transitions entering a state based on those surrounding it. It is rather a choice of classifier to make predictions, the one that looks at history and decides what is to follow and the one looking at surrounding transitions and making decisions based on that.

  • Where predictForwardOrSideways is true, we are predicting transitions based on paths leading to the state of interest. Parameter Inverse_Graph should be the (non-deterministic) inverse of graph.
  • Where predictForwardOrSideways is false, we are predicting transitions based on paths leading from the state of interest (sideways predictions). Parameter Inverse_Graph should be the same as graph and pathBeyondCurrentState should be null because once we predicted one transition, there are no further transitions from that state, hence no further transitions can be predicted sideways.

Examples of statechum.analysis.learning.MarkovModel