specless.automaton.mps
Functions
Finds the bounded, most probable string(s) (MPS) in a stochastically weighted finite automaton (SWFA). |
|
Makes one step of BMPS_exact search, updating all data structures. |
|
Computes the EXACT consensus string (the actual most probable string (MPS)) for a stochastically weighted DETERMINISTIC finite automaton (SWDFA). |
|
Post-processes the results from both MPS routines. |
|
Determine if we should use BMPS_exact based on the type of automaton we have and what we actually want to solve for |