Distinguishing tests for nondeterministic and probabilistic machines, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.363-372, 1995. ,
DOI : 10.1145/225058.225161
On decision problems for probabilistic büchi automata, FoSSaCS, pp.287-301, 2008. ,
Some recursive unsolvable problems relating to isolated cutpoints in probabilistic automata, Proceedings of ICALP, pp.87-94, 1977. ,
The solution of problems relative to probabilistic automata in the frame of the formal languages theory, Proc. of the 4th GI Jahrestagung, pp.107-112, 1974. ,
Undecidable Problems for Probabilistic Automata of Fixed Dimension, Theory of Computing Systems, pp.231-245, 2003. ,
DOI : 10.1007/s00224-003-1061-2
Probabilistic automata, Journal of Soviet Mathematics, vol.18, issue.No. 2, pp.359-386, 1980. ,
DOI : 10.1007/BF01088986
Power of Randomization in Automata on Infinite Strings, In CONCUR Lecture Notes in Computer Science, vol.6, issue.3, pp.229-243, 2009. ,
DOI : 10.1016/S0019-9958(63)90290-0
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages, SOFSEM '07, pp.309-319, 2007. ,
DOI : 10.1007/978-3-540-69507-3_25
Lower bounds for natural proof systems, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.254-266, 1977. ,
DOI : 10.1109/SFCS.1977.16
On the undecidability of probabilistic planning and related stochastic optimization problems, Artificial Intelligence, vol.147, issue.1-2, pp.5-34, 2003. ,
DOI : 10.1016/S0004-3702(02)00378-8
Introduction to probabilistic automata (Computer science and applied mathematics), 1971. ,
Probabilistic automata, Information and Control, vol.6, issue.3, pp.230-245, 1963. ,
A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata, SIAM Journal on Computing, vol.21, issue.2, pp.216-227, 1992. ,
DOI : 10.1137/0221017