Jun 5, 2017 · We develop a profinite approach for probabilistic automata, called prostochastic theory. This is inspired by the profinite approach for (classical) automata.
Jan 29, 2015 · 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 ...
Jan 13, 2015 · The first contribution of this paper is to give a characterisation of the Markov Monoid algorithm. The second contribution is to develop a ...
Missing: Optimality | Show results with:Optimality
Jan 13, 2015 · 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 ...
Abstract. We consider the value 1 problem for probabilistic automata over finite words: it asks whether a given probabilistic automaton accepts words with ...
Profinite techniques for probabilistic automata and the Markov Monoid algorithm · Nathanaël Fijalkow · Published in Theoretical Computer Science 13 January 2015 ...
The Markov monoid algorithm takes as input a probabilistic automaton, computes the Markov monoid of this automaton and looks for value 1 witnesses. Since ...
Missing: Optimality | Show results with:Optimality
Title: Profinite Techniques for Probabilistic Automata and the Markov Monoid Algorithm. Authors: Nathanaël Fijalkow. Comments: Conference version: STACS'2016 ...
Dec 22, 2024 · Profinite Techniques for Probabilistic Automata and the Optimality of the Markov Monoid Algorithm. CoRR abs/1501.02997 (2015). [i7]. view.
This survey paper presents the success story of the topological approach to automata theory. It is based on profinite topologies, which are built from finite ...