S. Agrawal, B. Akshay, P. S. Genest, and . Thiagarajan, Approximate verification of the symbolic dynamics of Markov chains, LICS, pp.55-64, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00920793

S. Agrawal, B. Akshay, P. S. Genest, and . Thiagarajan, Approximate verification of the symbolic dynamics of Markov chains, J.ACM, vol.62, issue.1, pp.183-235, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00920793

T. Akshay, J. Antonopoulos, J. Ouaknine, and . Worrell, Reachability problems for Markov chains, Information Processing Letters, vol.115, issue.2, pp.155-158, 2015.
DOI : 10.1016/j.ipl.2014.08.013

A. Bertoni, The solution of problems relative to probabilistic automata in the frame of the formal languages theory, GI Jahrestagung, pp.107-112, 1974.

D. Chadha, M. Kini, and . Viswanathan, Decidable Problems for Unary PFAs, QEST, pp.329-344, 2014.
DOI : 10.1007/978-3-319-10696-0_26

M. Chatterjee and . Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.185-194, 2012.
DOI : 10.1109/LICS.2012.29

H. Fijalkow, Y. Gimbert, and . Ouahladj, Deciding the Value 1 Problem for Probabilistic Leaktight Automata, LICS, pp.295-304, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01140262

Y. Gimbert and . Ouahladj, Probabilistic Automata on Finite Words: Decidable and Undecidable Problems, ICALP, pp.527-538, 2010.
DOI : 10.1007/978-3-642-14162-1_44

URL : https://hal.archives-ouvertes.fr/hal-00456538

T. Halava, M. Harju, and . Hirvensalo, Positivity of second order linear recurrent sequences, Discrete Applied Mathematics, vol.154, issue.3, 2006.
DOI : 10.1016/j.dam.2005.10.009

A. Korthikanti, M. Viswanathan, G. Agha, and Y. Kwon, Reasoning about MDPs as Transformers of Probability Distributions, 2010 Seventh International Conference on the Quantitative Evaluation of Systems, pp.199-208, 2010.
DOI : 10.1109/QEST.2010.35

. Lech, A note on recurring series, Arkiv f??r Matematik, vol.2, issue.5, 1953.
DOI : 10.1007/BF02590997

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

. Mahler, Eine arithmetische eigenschaft der taylor koeffizienten rationaler funktionen, Proc. Akad. Wet. Amsterdam, vol.38, 1935.

I. Maruthi, A. Tkachev, E. Carta, P. Cinquemani, G. Hersen et al., Towards Real-Time Control of Gene Expression at the Single Cell Level: A Stochastic Control Approach, CMSB, pp.155-172, 2014.
DOI : 10.1007/978-3-319-12982-2_12

URL : https://hal.archives-ouvertes.fr/hal-01096959

J. Ouaknine and . Worrell, Decision problems for linear recurrence sequences, RP, pp.21-28

J. Ouaknine and . Worrell, On the Positivity Problem for Simple Linear Recurrence Sequences,, ICALP, pp.318-329, 2014.
DOI : 10.1007/978-3-662-43951-7_27

J. Ouaknine and . Worrell, Positivity Problems for Low-Order Linear Recurrence Sequences, SODA. ACM-SIAM, 2014.
DOI : 10.1137/1.9781611973402.27

J. Ouaknine and . Worrell, Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences, ICALP, pp.330-341, 2014.
DOI : 10.1007/978-3-662-43951-7_28

A. Paz, Introduction to Probabilistic Automata, 1971.

O. Michael and . Rabin, Probabilistic automata, Information and Control Turakainen. On Stochastic Languages. Information and Control, vol.6, issue.12, pp.230-245304, 1963.