Login / Signup

Polynomial time decision algorithms for probabilistic automata.

Andrea TurriniHolger Hermanns
Published in: Inf. Comput. (2015)
Keyphrases
  • probabilistic automata
  • computational complexity
  • worst case
  • special case
  • learning algorithm
  • matching algorithm
  • order statistics
  • finite automata