Profinite Techniques for Probabilistic Automata and the Optimality of the Markov Monoid Algorithm

Nathanaël Fijalkow (1, 2)

1 MIMUW - Faculty of Mathematics, Informatics, and Mechanics [Warsaw]
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We consider the value 1 problem for probabilistic automata over finite words. This problem is known to be undecidable. However, different algorithms have been proposed to partially solve it. The aim of this paper is to prove that one such algorithm, called the Markov Monoid algorithm, is optimal. To this end, we develop a profinite theory for probabilistic automata. This new framework gives a topological account by constructing the free prostochastic monoid. We use it in two ways. First, to characterize the computations realized by the Markov Monoid algorithm, and second to prove its optimality.

Mots clés: Profinite Theory; Algebraic Algorithms in Automata Theory; Topology in Computer Science; Probabilistic Automata

Domaines: Informatique et théorie des jeux [cs.GT]

Nathanaël Fijalkow. Profinite Techniques for Probabilistic Automata and the Optimality of the Markov Monoid Algorithm. 2015. ⟨hal-01102610v2⟩