Login / Signup
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
Holger Hermanns
Andrea Turrini
Published in:
CoRR (2012)
Keyphrases
</>
probabilistic automata
finite automata
optimal planning
regular expressions
markov chain
grammatical inference
sound theoretical
relative entropy
special case
finite state automata
hidden markov models
regular languages
computational complexity
inductive inference
worst case
positive data
learning algorithm