R. Alur, C. Courcoubetis, and M. Yannakakis, 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

C. Baier, N. Bertrand, and M. Größer, On decision problems for probabilistic büchi automata, FoSSaCS, pp.287-301, 2008.

A. Bertoni, G. Mauri, and M. Torelli, Some recursive unsolvable problems relating to isolated cutpoints in probabilistic automata, Proceedings of ICALP, pp.87-94, 1977.

A. Bertoni, 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.

V. Blondel and V. Canterini, Undecidable Problems for Probabilistic Automata of Fixed Dimension, Theory of Computing Systems, pp.231-245, 2003.
DOI : 10.1007/s00224-003-1061-2

R. G. Bukharaev, Probabilistic automata, Journal of Soviet Mathematics, vol.18, issue.No. 2, pp.359-386, 1980.
DOI : 10.1007/BF01088986

R. Chadha, A. P. Sistla, and M. Viswanathan, 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

M. Hirvensalo, 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

D. Kozen, 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

O. Madani, S. Hanks, and A. Condon, 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

A. Paz, Introduction to probabilistic automata (Computer science and applied mathematics), 1971.

O. Michael and . Rabin, Probabilistic automata, Information and Control, vol.6, issue.3, pp.230-245, 1963.

W. Tzeng, 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