Characterisation of an algebraic algorithm for probabilistic automata

DOI10.4230/LIPICS.STACS.2016.34MaRDI QIDQ4601886zbMATH OpenOpenAlexFDO

Authors Nathanaël Fijalkow

Publication date 24 January 2018

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/5735/pdf/35.pdf/

zbMATH Keywords

algebraic algorithmMarkov monoid algorithmprobabilistic automataprofinite theorytopology in computer sciencevalue-1 problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

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

Cited in

(6)

• Deciding the value 1 problem for probabilistic leaktight automata
• Deciding the value 1 problem for probabilistic leaktight automata
• scientific article; zbMATH DE number 8012 (Why is no real title available?)
• Profinite techniques for probabilistic automata
• Profinite techniques for probabilistic automata and the Markov monoid algorithm
• scientific article; zbMATH DE number 5201472 (Why is no real title available?)

This page was built for publication: Characterisation of an algebraic algorithm for probabilistic automata

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