A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata.

Published in: SIAM J. Comput. (1992)

Keyphrases

dynamic programming
computational complexity
objective function
k means
worst case
expectation maximization
learning algorithm
optimal solution
matching algorithm
probabilistic model
state space
closed form