C. Bbbbb, N. Bbbbbbbb, G. , and M. , On Decision Problems for Probabilistic Büchi Automata Foundations of Software Science and Computational Structures, pp.287-301, 2008.

C. Bbbbb, G. , M. , B. , and N. , Probabilistic omegta-automata, Journal of the ACM, vol.59, issue.1, pp.1-52, 2012.

N. Bbbbbbbb, G. Blaise, G. , and H. , Qualitative determinacy and decidability of stochastic games with signals, 24th Annual IEEE Symposium on Logic In Computer Science, p.31, 2009.

D. Bbb, Discrete dynamic programming, Ann. Math. Statist, vol.33, issue.2, pp.719-726, 1962.

C. Bbbbbbb, Undecidable problems for probabilistic automata of xed dimension, Theory Comput. Systems, vol.36, issue.3, pp.231-24510, 2003.

. Bbbbbbb, . Tomás, . Bbbbbb, E. Václav, and K. , One-counter stochastic games, 2010.

B. , R. G. Rohit, K. Dileep, V. , and M. , Probabilistic automata Decidable Problems for Unary PFAs Quantitative Evaluation of Systems, Science + Business Media. doi:10.1007, pp.359-386, 1980.

0. Cccccc, K. Rohit, V. Anand, V. Mahesh, A. et al., Model checking mdps with a unique compact invariant set of distributions, Eighth International Conference on Quantitative Evaluation of SysTems, 2011.

C. , R. Ssssss, A. Prasad, and V. Mahesh, Power of Randomization in Automata on Innnite Strings, pp.229-243, 2009.

C. , R. Ssssss, A. Prasad, V. , and M. , Probabilistic Automata with Isolated Cut-Points, Mathematical Foundations of Computer Science, pp.254-265978, 2013.

2. Ccc, K. Hhhhhhhhh, T. A. , J. , and M. , Mean-payoo parity games, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05, p.26, 2005.

C. Krishnendu, D. , L. , H. , and T. A. , A survey of partialobservation stochastic parity games, Form Methods Syst Des, vol.43, issue.2, pp.268-284, 2012.

C. Krishnendu, . Dd, H. Laurent, T. A. , R. et al., Generalized mean-payoo and energy games. arXiv preprint, 2010.

C. Krishnendu, . Dd, N. Laurent, V. Sumit, M. Y. 7_16-ccc et al., The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies doi:10.1007/978-3-642-54830-7_16. URL http Automated Technology for Veriication and Analysis, Semiperfect-Information Games Probabilistic Automata on Innnite Words: Decidability and Undecidability Results, pp.242-257, 1007.

1. Ccc, J. Krishnendu, H. Marcin, and T. A. , Quantitative stochastic parity games, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '04, pp.121-130, 2004.

C. , K. , and T. Mathieu, Decidable problems for probabilistic automata on innnite words, 2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012.

C. , A. Hoblitzelle, P. , and G. Bambord, The algebraic theory of semigroups, 1961.

D. , L. , M. Thierry, S. , and M. , Innnite Synchronizing Words for Probabilistic Automata, Mathematical Foundations of Computer Science, pp.278-289, 2011.

D. , R. Eee, K. Sean, A. , M. et al., Biological sequence analysis cambridge university press, 1998.

F. Nathanaël, . Ggggggg, H. Hugo, F. , O. et al., Two Recursively Inseparable Problems for Probabilistic Automata, Mathematical Foundations of Computer Science, pp.267-278978, 2014.

F. Nathanaël, . Ggggggg, K. Hugo, O. Edon, and Y. , Deciding the value 1 problem for probabilistic leaktight automata, Logical Methods in Computer Science, vol.11, issue.222, pp.2168-1112, 2015.

F. , N. , and K. Denis, ACME: Automata with Counters, Monoids and Equivalence Automated Technology for Veriication and Analysis, pp.163-16710, 2014.

F. Nathanaël, . Ggggggg, K. Hugo, K. Edon, and D. , Stamina (stabilization monoids in automata theory), pp.2016-2023, 2016.

D. Gggggggg, Stochastic games with zero stop probabilities, Contributions to the Theory of Games, pp.179-187, 1957.

G. , H. , and K. Edon, Two-player perfect-information shift-invariant submixing stochastic games are half-positional

G. , H. , R. Jérôme, . Sssss, V. Sylvain et al., On values of repeated games with signals, Pure and stationary optimal strategies in perfectinformation stochastic games, pp.402-424, 2009.

H. and G. Harold, Divergent series, 2000.

K. , V. Anand, V. Mahesh, A. , K. et al., Reasoning about mdps as transformers of probability distributions, Seventh International Conference on the Quantitative Evaluation of Systems, 2010.

L. , T. M. , L. Steven, and A. , Stochastic games with perfect information and time average payoo, SIAM Rev, vol.11, issue.4, pp.604-607, 1969.

P. , J. Eric, M. , and R. E. , Varieties of formal languages, 1986.

R. , J. , C. Krishnendu, D. , L. et al., Algorithms for omega-regular games with imperfect information, Logical Methods in Computer Science, vol.3, issue.3, 2007.

I. Sssss, Factorization forests of nite height, Theoretical Computer Science, vol.72, issue.190, pp.65-94, 1990.

I. Sssss, On semigroups of matrices over the tropical semiring, ITA, vol.28, pp.3-4277, 1994.