Login / Signup

On the Complexity of the Equivalence Problem for Probabilistic Automata.

Stefan KieferAndrzej S. MurawskiJoël OuaknineBjörn WachterJames Worrell
Published in: FoSSaCS (2012)
Keyphrases
  • probabilistic automata
  • finite automata
  • relative entropy
  • worst case
  • computational complexity
  • markov chain
  • finite state automata
  • mixture model