Publisher
Springer International Publishing
Reference11 articles.
1. Baier, C., Größer, M.: Recognizing
$$\omega $$
ω
-regular languages with probabilistic automata. In: 20th IEEE Symposium on Logic in Computer Science, pp. 137–146 (2005)
2. Baier, C., Größer, M., Bertrand, N.: Probabilistic
$$\omega $$
ω
-automata. J. ACM 59(1), 1–52 (2012)
3. Lecture Notes in Computer Science;C Baier,2004
4. Lecture Notes in Computer Science;R Chadha,2011
5. Chadha, R., Sistla, A.P., Viswanathan, M.: Power of randomization in automata on infinite strings. Log. Methods Comput. Sci. 7(3), 1–22 (2011)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献