Computing the Most Probable String with a Probabilistic Finite State Machine.
Colin de la HigueraJosé OncinaPublished in: FSMNLP (2013)
Keyphrases
- finite state machines
- regular expressions
- finite state automata
- belief networks
- model checking
- state machine
- bayesian networks
- probability distribution
- generative model
- pattern matching
- probabilistic model
- probabilistic logic programs
- databases
- digital circuits
- string matching
- state transition
- uncertain data
- data structure
- fault tolerant