Profinite techniques for probabilistic automata and the Markov monoid algorithm

DOI10.1016/J.TCS.2017.04.006zbMath1370.68168arXiv1501.02997OpenAlexW2605631145MaRDI QIDQ529062

Nathanaël Fijalkow

Publication date: 18 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.02997

zbMATH Keywords

topologyprobabilistic automataprofinite theory

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the value 1 problem for probabilistic leaktight automata
• Decidable Problems for Probabilistic Automata on Infinite Words
• Deciding the Value 1 Problem for Probabilistic Leaktight Automata
• Languages of Profinite Words and the Limitedness Problem
• A Topological Approach to Recognition
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• Characterisation of an Algebraic Algorithm for Probabilistic Automata
• Profinite Methods in Automata Theory
• Probabilistic automata

This page was built for publication: Profinite techniques for probabilistic automata and the Markov monoid algorithm