Profinite techniques for probabilistic automata

MaRDI QIDQ4967235zbMATH OpenFDO

Authors Nathanaël Fijalkow

Publication date 3 July 2019

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/497/485

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Profinite techniques for probabilistic automata and the Markov monoid algorithm
• Characterisation of an algebraic algorithm for probabilistic automata
• Probabilistic automata on finite words: decidable and undecidable problems
• Probabilistic automata of bounded ambiguity
• Deciding the value 1 problem for probabilistic leaktight automata

Cited in

(6)

• NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
• Characterisation of an algebraic algorithm for probabilistic automata
• The big-O problem
• Profinite techniques for probabilistic automata and the Markov monoid algorithm
• Profinite Methods in Automata Theory
• Probabilism versus Alternation for Automata

This page was built for publication: Profinite techniques for probabilistic automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967235)