Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time.

Holger Hermanns Andrea Turrini

Published in: FSTTCS (2012)

Keyphrases

probabilistic automata
finite automata
markov chain
optimal planning
relative entropy
grammatical inference
finite state automata
regular expressions
special case
sound theoretical
computational complexity
worst case
information theory
np hard
pattern matching