What is known about the Value 1 Problem for Probabilistic Automata?

Nathanaël Fijalkow

Type: Preprint

Publication Date: 2014-01-01

Citations: 2

DOI: https://doi.org/10.48550/arxiv.1410.3770

View Publication

Locations

arXiv (Cornell University) - View
HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Characterisation of an Algebraic Algorithm for Probabilistic Automata Characterisation of an Algebraic Algorithm for Probabilistic Automata	2016	Nathanaël Fijalkow
+	Deciding the Value 1 Problem of Probabilistic Leaktight Automata	2011	Nathanaël Fijalkow Hugo Gimbert Youssouf Oualhadj
+ PDF Chat	Deciding the value 1 problem for probabilistic leaktight automata	2015	Nathanaël Fijalkow Hugo Gimbert Edon Kelmendi Youssouf Oualhadj
+	Deciding the value 1 problem for probabilistic leaktight automata	2015	Nathanaël Fijalkow Hugo Gimbert Edon Kelmendi Youssouf Oualhadj
+ PDF Chat	Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability	2009	Christel Baier Nathalie Bertrand Marcus Größer
+	A theory of probabilistic automata, part 1	2015	Andrew M. Mironov
+ PDF Chat	Probabilistic Finite Automaton Emptiness is undecidable	2024	Günter Rote
+	Profinite techniques for probabilistic automata and the Markov Monoid algorithm	2017	Nathanaël Fijalkow
+ PDF Chat	Decidable Problems for Probabilistic Automata on Infinite Words	2012	Krishnendu Chatterjee Mathieu Tracol
+	Decidable Problems for Probabilistic Automata on Infinite Words	2011	Krishnendu Chatterjee Mathieu Tracol
+	Decidable Problems for Probabilistic Automata on Infinite Words	2011	Krishnendu Chatterjee Mathieu Tracol
+	On Semantically-Deterministic Automata	2023	Bader Abu Radi Orna Kupferman
+ PDF Chat	Stability and Complexity of Minimising Probabilistic Automata	2014	Stefan Kiefer Björn Wachter
+	Probabilistic automata for computing with words	2012	Yongzhi Cao Lirong Xia Mingsheng Ying
+	Non-deterministic weighted automata evaluated over Markov chains	2019	Jakub Michaliszyn Jan Otop
+	Probabilistic Weighted Automata	2009	Krishnendu Chatterjee Laurent Doyen Thomas A. Henzinger
+ PDF Chat	The Complexity of Finding Reset Words in Finite Automata	2010	Jörg Olschewski Michael Ummels
+ PDF Chat	Lengths of words accepted by nondeterministic finite automata	2020	Aaron Potechin Jeffrey Shallit
+	Weighted Tree Automata -- May it be a little more?	2022	Zoltán Fülöp Heiko Vogler
+ PDF Chat	Probabilistic automatic complexity of finite strings	2024	Kenneth Gill

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Deciding the value 1 problem for probabilistic leaktight automata	2015	Nathanaël Fijalkow Hugo Gimbert Edon Kelmendi Youssouf Oualhadj

Works Cited by This (1)

Action	Title	Year	Authors
+ PDF Chat	Decidable Problems for Probabilistic Automata on Infinite Words	2012	Krishnendu Chatterjee Mathieu Tracol